./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:41:15,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:41:15,370 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:41:15,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:41:15,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:41:15,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:41:15,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:41:15,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:41:15,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:41:15,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:41:15,438 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:41:15,438 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:41:15,438 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:41:15,438 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:41:15,438 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:41:15,439 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:41:15,440 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:41:15,440 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:41:15,440 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:41:15,441 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:41:15,441 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:41:15,441 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:41:15,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:41:15,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:41:15,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:41:15,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:41:15,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:41:15,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:41:15,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:41:15,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:41:15,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:41:15,443 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:41:15,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:41:15,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:41:15,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:41:15,444 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:41:15,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:41:15,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:41:15,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:41:15,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:41:15,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:41:15,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:41:15,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:41:15,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:41:15,446 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:41:15,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:41:15,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:41:15,447 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:41:15,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:41:15,447 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2024-11-14 05:41:15,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:41:15,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:41:15,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:41:15,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:41:15,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:41:15,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c Unable to find full path for "g++" [2024-11-14 05:41:18,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:41:18,383 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:41:18,397 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2024-11-14 05:41:18,418 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/data/2c4d2c5d6/4c69c2462f634e6681aac50649da2c9c/FLAG87378e84a [2024-11-14 05:41:18,448 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/data/2c4d2c5d6/4c69c2462f634e6681aac50649da2c9c [2024-11-14 05:41:18,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:41:18,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:41:18,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:41:18,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:41:18,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:41:18,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af6a946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18, skipping insertion in model container [2024-11-14 05:41:18,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:41:18,747 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:41:18,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:41:18,770 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:41:18,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:41:18,847 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:41:18,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18 WrapperNode [2024-11-14 05:41:18,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:41:18,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:41:18,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:41:18,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:41:18,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,923 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 261 [2024-11-14 05:41:18,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:41:18,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:41:18,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:41:18,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:41:18,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:18,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:41:18,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:41:18,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:41:18,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:41:18,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (1/1) ... [2024-11-14 05:41:19,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:41:19,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:19,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:41:19,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:41:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:41:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 05:41:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 05:41:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 05:41:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 05:41:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-14 05:41:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-14 05:41:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:41:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:41:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:41:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:41:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:41:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:41:19,091 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 05:41:19,292 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:41:19,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:41:20,164 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 05:41:20,164 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:41:20,900 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:41:20,900 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-14 05:41:20,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:41:20 BoogieIcfgContainer [2024-11-14 05:41:20,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:41:20,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:41:20,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:41:20,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:41:20,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:41:18" (1/3) ... [2024-11-14 05:41:20,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752243ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:41:20, skipping insertion in model container [2024-11-14 05:41:20,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:18" (2/3) ... [2024-11-14 05:41:20,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752243ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:41:20, skipping insertion in model container [2024-11-14 05:41:20,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:41:20" (3/3) ... [2024-11-14 05:41:20,917 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2024-11-14 05:41:20,937 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:41:20,941 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 55 locations, 1 initial locations, 5 loop locations, and 18 error locations. [2024-11-14 05:41:20,941 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 05:41:21,049 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-14 05:41:21,126 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 59 transitions, 139 flow [2024-11-14 05:41:21,444 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2541 states, 2411 states have (on average 3.5897967648278724) internal successors, (8655), 2540 states have internal predecessors, (8655), 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) [2024-11-14 05:41:21,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:41:21,501 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@2c9c3669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:41:21,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-11-14 05:41:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 2541 states, 2411 states have (on average 3.5897967648278724) internal successors, (8655), 2540 states have internal predecessors, (8655), 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) [2024-11-14 05:41:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 05:41:21,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:21,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 05:41:21,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:21,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash 889477, now seen corresponding path program 1 times [2024-11-14 05:41:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:21,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846330666] [2024-11-14 05:41:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:21,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846330666] [2024-11-14 05:41:21,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846330666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:21,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:41:21,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:41:21,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847324518] [2024-11-14 05:41:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:21,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:41:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:41:21,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:41:21,939 INFO L87 Difference]: Start difference. First operand has 2541 states, 2411 states have (on average 3.5897967648278724) internal successors, (8655), 2540 states have internal predecessors, (8655), 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, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-11-14 05:41:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:22,220 INFO L93 Difference]: Finished difference Result 2541 states and 8655 transitions. [2024-11-14 05:41:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:41:22,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-11-14 05:41:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:22,284 INFO L225 Difference]: With dead ends: 2541 [2024-11-14 05:41:22,285 INFO L226 Difference]: Without dead ends: 2537 [2024-11-14 05:41:22,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:41:22,296 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:22,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:41:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2024-11-14 05:41:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2537. [2024-11-14 05:41:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2410 states have (on average 3.5896265560165976) internal successors, (8651), 2536 states have internal predecessors, (8651), 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) [2024-11-14 05:41:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 8651 transitions. [2024-11-14 05:41:22,568 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 8651 transitions. Word has length 3 [2024-11-14 05:41:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:22,570 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 8651 transitions. [2024-11-14 05:41:22,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-11-14 05:41:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 8651 transitions. [2024-11-14 05:41:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 05:41:22,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:22,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 05:41:22,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:41:22,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:22,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:22,574 INFO L85 PathProgramCache]: Analyzing trace with hash 889478, now seen corresponding path program 1 times [2024-11-14 05:41:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:22,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301633518] [2024-11-14 05:41:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:23,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:23,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301633518] [2024-11-14 05:41:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301633518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:23,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:41:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:41:23,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885946012] [2024-11-14 05:41:23,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:23,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:41:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:23,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:41:23,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:41:23,096 INFO L87 Difference]: Start difference. First operand 2537 states and 8651 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-14 05:41:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:23,397 INFO L93 Difference]: Finished difference Result 2540 states and 8655 transitions. [2024-11-14 05:41:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:41:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-14 05:41:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:23,433 INFO L225 Difference]: With dead ends: 2540 [2024-11-14 05:41:23,433 INFO L226 Difference]: Without dead ends: 2539 [2024-11-14 05:41:23,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:41:23,437 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:23,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:41:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2024-11-14 05:41:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2539. [2024-11-14 05:41:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 2412 states have (on average 3.587893864013267) internal successors, (8654), 2538 states have internal predecessors, (8654), 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) [2024-11-14 05:41:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 8654 transitions. [2024-11-14 05:41:23,620 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 8654 transitions. Word has length 3 [2024-11-14 05:41:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:23,620 INFO L471 AbstractCegarLoop]: Abstraction has 2539 states and 8654 transitions. [2024-11-14 05:41:23,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-14 05:41:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 8654 transitions. [2024-11-14 05:41:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 05:41:23,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:23,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 05:41:23,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:41:23,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:23,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 27576100, now seen corresponding path program 1 times [2024-11-14 05:41:23,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:23,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764529667] [2024-11-14 05:41:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:23,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:23,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:23,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764529667] [2024-11-14 05:41:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764529667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:23,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:41:23,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:41:23,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478450078] [2024-11-14 05:41:23,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:23,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:41:23,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:23,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:41:23,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:41:23,901 INFO L87 Difference]: Start difference. First operand 2539 states and 8654 transitions. Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 05:41:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:24,162 INFO L93 Difference]: Finished difference Result 5076 states and 17306 transitions. [2024-11-14 05:41:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:41:24,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-14 05:41:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:24,199 INFO L225 Difference]: With dead ends: 5076 [2024-11-14 05:41:24,199 INFO L226 Difference]: Without dead ends: 2542 [2024-11-14 05:41:24,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:41:24,216 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:24,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 62 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:41:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-11-14 05:41:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2540. [2024-11-14 05:41:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2413 states have (on average 3.586406962287609) internal successors, (8654), 2539 states have internal predecessors, (8654), 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) [2024-11-14 05:41:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 8654 transitions. [2024-11-14 05:41:24,447 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 8654 transitions. Word has length 4 [2024-11-14 05:41:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:24,447 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 8654 transitions. [2024-11-14 05:41:24,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 05:41:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 8654 transitions. [2024-11-14 05:41:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:41:24,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:24,448 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2024-11-14 05:41:24,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:41:24,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:24,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash 854816780, now seen corresponding path program 1 times [2024-11-14 05:41:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:24,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202736099] [2024-11-14 05:41:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:24,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202736099] [2024-11-14 05:41:24,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202736099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:24,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737515988] [2024-11-14 05:41:24,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:24,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:24,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:24,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:24,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:41:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:25,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 05:41:25,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:25,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-14 05:41:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:25,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737515988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:25,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1895711471] [2024-11-14 05:41:25,660 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:25,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:25,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-14 05:41:25,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80757622] [2024-11-14 05:41:25,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:41:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:25,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:41:25,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:41:25,668 INFO L87 Difference]: Start difference. First operand 2540 states and 8654 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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) [2024-11-14 05:41:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:26,152 INFO L93 Difference]: Finished difference Result 2542 states and 8658 transitions. [2024-11-14 05:41:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:41:26,153 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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 5 [2024-11-14 05:41:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:26,184 INFO L225 Difference]: With dead ends: 2542 [2024-11-14 05:41:26,184 INFO L226 Difference]: Without dead ends: 2541 [2024-11-14 05:41:26,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:41:26,187 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:26,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:41:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2024-11-14 05:41:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 2538. [2024-11-14 05:41:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2412 states have (on average 3.5870646766169156) internal successors, (8652), 2537 states have internal predecessors, (8652), 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) [2024-11-14 05:41:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 8652 transitions. [2024-11-14 05:41:26,323 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 8652 transitions. Word has length 5 [2024-11-14 05:41:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:26,324 INFO L471 AbstractCegarLoop]: Abstraction has 2538 states and 8652 transitions. [2024-11-14 05:41:26,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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) [2024-11-14 05:41:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 8652 transitions. [2024-11-14 05:41:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:41:26,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:26,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:41:26,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:41:26,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:26,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:26,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash 729518686, now seen corresponding path program 1 times [2024-11-14 05:41:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376337172] [2024-11-14 05:41:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:26,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:26,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376337172] [2024-11-14 05:41:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376337172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50365557] [2024-11-14 05:41:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:26,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:26,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:41:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:27,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 05:41:27,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:27,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:41:27,334 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:41:27,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2024-11-14 05:41:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:27,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50365557] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:27,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:41:27,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2024-11-14 05:41:27,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349158462] [2024-11-14 05:41:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:27,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:41:27,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:27,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:41:27,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:41:27,513 INFO L87 Difference]: Start difference. First operand 2538 states and 8652 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2024-11-14 05:41:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:27,716 INFO L93 Difference]: Finished difference Result 2541 states and 8655 transitions. [2024-11-14 05:41:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:41:27,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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 [2024-11-14 05:41:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:27,747 INFO L225 Difference]: With dead ends: 2541 [2024-11-14 05:41:27,747 INFO L226 Difference]: Without dead ends: 2540 [2024-11-14 05:41:27,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:41:27,750 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:27,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 30 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:41:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2024-11-14 05:41:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2539. [2024-11-14 05:41:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 2413 states have (on average 3.5859925404061332) internal successors, (8653), 2538 states have internal predecessors, (8653), 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) [2024-11-14 05:41:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 8653 transitions. [2024-11-14 05:41:27,873 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 8653 transitions. Word has length 6 [2024-11-14 05:41:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:27,874 INFO L471 AbstractCegarLoop]: Abstraction has 2539 states and 8653 transitions. [2024-11-14 05:41:27,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2024-11-14 05:41:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 8653 transitions. [2024-11-14 05:41:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:41:27,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:27,875 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:27,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:41:28,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:28,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:28,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 987817033, now seen corresponding path program 1 times [2024-11-14 05:41:28,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:28,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142725755] [2024-11-14 05:41:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:28,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:28,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142725755] [2024-11-14 05:41:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142725755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:28,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704169021] [2024-11-14 05:41:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:28,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:28,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:28,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:28,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:41:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:28,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:41:28,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:28,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:28,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704169021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:28,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159817356] [2024-11-14 05:41:28,702 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:28,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:28,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-14 05:41:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121360880] [2024-11-14 05:41:28,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:28,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:41:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:28,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:41:28,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:41:28,708 INFO L87 Difference]: Start difference. First operand 2539 states and 8653 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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) [2024-11-14 05:41:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:29,153 INFO L93 Difference]: Finished difference Result 7611 states and 25953 transitions. [2024-11-14 05:41:29,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:41:29,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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 8 [2024-11-14 05:41:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:29,227 INFO L225 Difference]: With dead ends: 7611 [2024-11-14 05:41:29,228 INFO L226 Difference]: Without dead ends: 5078 [2024-11-14 05:41:29,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:41:29,237 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:29,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 152 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:41:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2024-11-14 05:41:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 2544. [2024-11-14 05:41:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2418 states have (on average 3.5810587262200166) internal successors, (8659), 2543 states have internal predecessors, (8659), 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) [2024-11-14 05:41:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8659 transitions. [2024-11-14 05:41:29,402 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8659 transitions. Word has length 8 [2024-11-14 05:41:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:29,403 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 8659 transitions. [2024-11-14 05:41:29,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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) [2024-11-14 05:41:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8659 transitions. [2024-11-14 05:41:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:41:29,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:29,405 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-14 05:41:29,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:41:29,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:29,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1182039421, now seen corresponding path program 2 times [2024-11-14 05:41:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:29,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904172136] [2024-11-14 05:41:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:29,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:30,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:30,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904172136] [2024-11-14 05:41:30,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904172136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:30,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326119740] [2024-11-14 05:41:30,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:41:30,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:30,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:30,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:30,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:41:30,294 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:41:30,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:41:30,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:41:30,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:30,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:41:30,500 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:41:30,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2024-11-14 05:41:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:41:30,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:41:31,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326119740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:31,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [403580535] [2024-11-14 05:41:31,064 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:31,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:31,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2024-11-14 05:41:31,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887838708] [2024-11-14 05:41:31,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:31,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:41:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:31,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:41:31,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:41:31,067 INFO L87 Difference]: Start difference. First operand 2544 states and 8659 transitions. Second operand has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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) [2024-11-14 05:41:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:32,617 INFO L93 Difference]: Finished difference Result 5089 states and 17324 transitions. [2024-11-14 05:41:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:41:32,621 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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 [2024-11-14 05:41:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:32,647 INFO L225 Difference]: With dead ends: 5089 [2024-11-14 05:41:32,648 INFO L226 Difference]: Without dead ends: 2558 [2024-11-14 05:41:32,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2024-11-14 05:41:32,657 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 142 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:32,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 110 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:41:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2024-11-14 05:41:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2555. [2024-11-14 05:41:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2429 states have (on average 3.5710168793742283) internal successors, (8674), 2554 states have internal predecessors, (8674), 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) [2024-11-14 05:41:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 8674 transitions. [2024-11-14 05:41:32,773 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 8674 transitions. Word has length 10 [2024-11-14 05:41:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:32,774 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 8674 transitions. [2024-11-14 05:41:32,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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) [2024-11-14 05:41:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 8674 transitions. [2024-11-14 05:41:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:41:32,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:32,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:32,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:41:32,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:32,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:32,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1054693069, now seen corresponding path program 1 times [2024-11-14 05:41:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50137060] [2024-11-14 05:41:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:33,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50137060] [2024-11-14 05:41:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50137060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:33,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:41:33,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:41:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873118279] [2024-11-14 05:41:33,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:33,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:41:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:41:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:41:33,179 INFO L87 Difference]: Start difference. First operand 2555 states and 8674 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-14 05:41:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:33,316 INFO L93 Difference]: Finished difference Result 2555 states and 8674 transitions. [2024-11-14 05:41:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:41:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-14 05:41:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:33,335 INFO L225 Difference]: With dead ends: 2555 [2024-11-14 05:41:33,335 INFO L226 Difference]: Without dead ends: 1915 [2024-11-14 05:41:33,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:41:33,339 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:33,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 18 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:41:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2024-11-14 05:41:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1915. [2024-11-14 05:41:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1850 states have (on average 3.496216216216216) internal successors, (6468), 1914 states have internal predecessors, (6468), 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) [2024-11-14 05:41:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 6468 transitions. [2024-11-14 05:41:33,421 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 6468 transitions. Word has length 11 [2024-11-14 05:41:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:33,421 INFO L471 AbstractCegarLoop]: Abstraction has 1915 states and 6468 transitions. [2024-11-14 05:41:33,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-14 05:41:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 6468 transitions. [2024-11-14 05:41:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:41:33,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:33,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:33,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:41:33,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:33,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1054693068, now seen corresponding path program 1 times [2024-11-14 05:41:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:33,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067387568] [2024-11-14 05:41:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:33,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:33,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067387568] [2024-11-14 05:41:33,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067387568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:33,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472247043] [2024-11-14 05:41:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:33,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:33,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:33,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:33,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:41:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:33,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 05:41:33,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:33,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:41:33,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:41:34,081 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:41:34,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2024-11-14 05:41:34,121 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:41:34,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:41:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:34,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472247043] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:34,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:41:34,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2024-11-14 05:41:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521452036] [2024-11-14 05:41:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:34,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:41:34,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:41:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:41:34,802 INFO L87 Difference]: Start difference. First operand 1915 states and 6468 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-14 05:41:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:35,224 INFO L93 Difference]: Finished difference Result 2581 states and 8982 transitions. [2024-11-14 05:41:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:41:35,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2024-11-14 05:41:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:35,244 INFO L225 Difference]: With dead ends: 2581 [2024-11-14 05:41:35,244 INFO L226 Difference]: Without dead ends: 2359 [2024-11-14 05:41:35,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:41:35,246 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:35,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 28 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:41:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-11-14 05:41:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2359. [2024-11-14 05:41:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2294 states have (on average 3.5823888404533566) internal successors, (8218), 2358 states have internal predecessors, (8218), 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) [2024-11-14 05:41:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 8218 transitions. [2024-11-14 05:41:35,346 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 8218 transitions. Word has length 11 [2024-11-14 05:41:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:35,347 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 8218 transitions. [2024-11-14 05:41:35,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-14 05:41:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 8218 transitions. [2024-11-14 05:41:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:41:35,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:35,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:35,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 05:41:35,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:35,554 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:35,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1664254101, now seen corresponding path program 1 times [2024-11-14 05:41:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:35,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743158059] [2024-11-14 05:41:35,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:35,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:35,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743158059] [2024-11-14 05:41:35,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743158059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:35,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:41:35,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:41:35,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013024284] [2024-11-14 05:41:35,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:35,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:41:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:35,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:41:35,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:41:35,639 INFO L87 Difference]: Start difference. First operand 2359 states and 8218 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-14 05:41:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:35,740 INFO L93 Difference]: Finished difference Result 2359 states and 8218 transitions. [2024-11-14 05:41:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:41:35,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-14 05:41:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:35,756 INFO L225 Difference]: With dead ends: 2359 [2024-11-14 05:41:35,756 INFO L226 Difference]: Without dead ends: 1757 [2024-11-14 05:41:35,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:41:35,759 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:35,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 18 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:41:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2024-11-14 05:41:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1757. [2024-11-14 05:41:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1729 states have (on average 3.5303643724696356) internal successors, (6104), 1756 states have internal predecessors, (6104), 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) [2024-11-14 05:41:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 6104 transitions. [2024-11-14 05:41:35,824 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 6104 transitions. Word has length 12 [2024-11-14 05:41:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:35,824 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 6104 transitions. [2024-11-14 05:41:35,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-14 05:41:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 6104 transitions. [2024-11-14 05:41:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:41:35,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:35,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:35,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:41:35,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:35,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1664254102, now seen corresponding path program 1 times [2024-11-14 05:41:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274066942] [2024-11-14 05:41:35,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:35,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:36,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274066942] [2024-11-14 05:41:36,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274066942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500070683] [2024-11-14 05:41:36,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:36,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:36,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:36,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:36,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:41:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:36,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:41:36,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:36,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:36,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-14 05:41:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500070683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2115475778] [2024-11-14 05:41:36,483 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:36,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:36,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-14 05:41:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304053936] [2024-11-14 05:41:36,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:36,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:41:36,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:41:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:41:36,486 INFO L87 Difference]: Start difference. First operand 1757 states and 6104 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 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) [2024-11-14 05:41:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:36,987 INFO L93 Difference]: Finished difference Result 2121 states and 7354 transitions. [2024-11-14 05:41:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:41:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 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 12 [2024-11-14 05:41:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:37,006 INFO L225 Difference]: With dead ends: 2121 [2024-11-14 05:41:37,006 INFO L226 Difference]: Without dead ends: 1939 [2024-11-14 05:41:37,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:41:37,009 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 90 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:37,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 55 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:41:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2024-11-14 05:41:37,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2024-11-14 05:41:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1911 states have (on average 3.521193092621664) internal successors, (6729), 1938 states have internal predecessors, (6729), 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) [2024-11-14 05:41:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 6729 transitions. [2024-11-14 05:41:37,084 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 6729 transitions. Word has length 12 [2024-11-14 05:41:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:37,085 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 6729 transitions. [2024-11-14 05:41:37,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 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) [2024-11-14 05:41:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 6729 transitions. [2024-11-14 05:41:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 05:41:37,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:37,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:37,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 05:41:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 05:41:37,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:37,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash 45871315, now seen corresponding path program 1 times [2024-11-14 05:41:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142708801] [2024-11-14 05:41:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:37,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:37,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142708801] [2024-11-14 05:41:37,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142708801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:37,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577562205] [2024-11-14 05:41:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:37,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:37,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:37,453 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:37,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:41:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:37,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:41:37,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:37,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:37,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577562205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:37,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224904962] [2024-11-14 05:41:37,821 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:37,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:37,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 05:41:37,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537943289] [2024-11-14 05:41:37,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:37,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 05:41:37,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:37,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 05:41:37,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:41:37,823 INFO L87 Difference]: Start difference. First operand 1939 states and 6729 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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) [2024-11-14 05:41:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:38,275 INFO L93 Difference]: Finished difference Result 4283 states and 14921 transitions. [2024-11-14 05:41:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:41:38,275 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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 13 [2024-11-14 05:41:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:38,298 INFO L225 Difference]: With dead ends: 4283 [2024-11-14 05:41:38,299 INFO L226 Difference]: Without dead ends: 2599 [2024-11-14 05:41:38,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:41:38,304 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 160 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:38,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 122 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:41:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2024-11-14 05:41:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2378. [2024-11-14 05:41:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2350 states have (on average 3.508936170212766) internal successors, (8246), 2377 states have internal predecessors, (8246), 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) [2024-11-14 05:41:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 8246 transitions. [2024-11-14 05:41:38,398 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 8246 transitions. Word has length 13 [2024-11-14 05:41:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:38,399 INFO L471 AbstractCegarLoop]: Abstraction has 2378 states and 8246 transitions. [2024-11-14 05:41:38,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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) [2024-11-14 05:41:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 8246 transitions. [2024-11-14 05:41:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 05:41:38,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:38,401 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:38,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:41:38,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:38,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:38,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1620387611, now seen corresponding path program 1 times [2024-11-14 05:41:38,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:38,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576248781] [2024-11-14 05:41:38,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:38,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:38,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576248781] [2024-11-14 05:41:38,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576248781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:38,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603229780] [2024-11-14 05:41:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:38,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:38,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:38,830 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:38,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:41:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:38,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:41:38,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:39,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603229780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:39,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [320941819] [2024-11-14 05:41:39,173 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:39,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:39,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 05:41:39,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5980307] [2024-11-14 05:41:39,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:39,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 05:41:39,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:39,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 05:41:39,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:41:39,177 INFO L87 Difference]: Start difference. First operand 2378 states and 8246 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 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) [2024-11-14 05:41:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:39,691 INFO L93 Difference]: Finished difference Result 2762 states and 9270 transitions. [2024-11-14 05:41:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:41:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 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 [2024-11-14 05:41:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:39,712 INFO L225 Difference]: With dead ends: 2762 [2024-11-14 05:41:39,712 INFO L226 Difference]: Without dead ends: 2351 [2024-11-14 05:41:39,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:41:39,715 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 99 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:39,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 162 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:41:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2024-11-14 05:41:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2310. [2024-11-14 05:41:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2282 states have (on average 3.462313759859772) internal successors, (7901), 2309 states have internal predecessors, (7901), 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) [2024-11-14 05:41:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 7901 transitions. [2024-11-14 05:41:39,799 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 7901 transitions. Word has length 14 [2024-11-14 05:41:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:39,799 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 7901 transitions. [2024-11-14 05:41:39,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 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) [2024-11-14 05:41:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 7901 transitions. [2024-11-14 05:41:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:41:39,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:39,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:39,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:41:40,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:40,005 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:40,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:40,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1110382442, now seen corresponding path program 1 times [2024-11-14 05:41:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:40,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476198620] [2024-11-14 05:41:40,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:40,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:40,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476198620] [2024-11-14 05:41:40,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476198620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:40,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:41:40,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:41:40,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058957831] [2024-11-14 05:41:40,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:40,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:41:40,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:40,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:41:40,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:41:40,432 INFO L87 Difference]: Start difference. First operand 2310 states and 7901 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2024-11-14 05:41:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:40,779 INFO L93 Difference]: Finished difference Result 2988 states and 10509 transitions. [2024-11-14 05:41:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:41:40,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2024-11-14 05:41:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:40,799 INFO L225 Difference]: With dead ends: 2988 [2024-11-14 05:41:40,800 INFO L226 Difference]: Without dead ends: 2762 [2024-11-14 05:41:40,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:41:40,802 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 101 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:40,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 14 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:41:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2024-11-14 05:41:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2024-11-14 05:41:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2734 states have (on average 3.55340160936357) internal successors, (9715), 2761 states have internal predecessors, (9715), 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) [2024-11-14 05:41:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 9715 transitions. [2024-11-14 05:41:40,895 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 9715 transitions. Word has length 15 [2024-11-14 05:41:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:40,897 INFO L471 AbstractCegarLoop]: Abstraction has 2762 states and 9715 transitions. [2024-11-14 05:41:40,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2024-11-14 05:41:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 9715 transitions. [2024-11-14 05:41:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:41:40,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:40,898 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 1, 1, 1] [2024-11-14 05:41:40,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:41:40,899 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:40,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1629506628, now seen corresponding path program 3 times [2024-11-14 05:41:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:40,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502817370] [2024-11-14 05:41:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:40,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:41,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502817370] [2024-11-14 05:41:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502817370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533356268] [2024-11-14 05:41:41,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:41:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:41,169 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:41,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:41:41,301 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:41:41,301 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:41:41,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:41:41,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:41:41,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:41:41,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533356268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [119126045] [2024-11-14 05:41:41,626 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:41,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:41,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-11-14 05:41:41,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397534171] [2024-11-14 05:41:41,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:41,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:41:41,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:41,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:41:41,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:41:41,630 INFO L87 Difference]: Start difference. First operand 2762 states and 9715 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 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) [2024-11-14 05:41:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:42,169 INFO L93 Difference]: Finished difference Result 7359 states and 26209 transitions. [2024-11-14 05:41:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:41:42,170 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 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 [2024-11-14 05:41:42,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:42,207 INFO L225 Difference]: With dead ends: 7359 [2024-11-14 05:41:42,207 INFO L226 Difference]: Without dead ends: 5059 [2024-11-14 05:41:42,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:41:42,214 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 119 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:42,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 156 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:41:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2024-11-14 05:41:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 2764. [2024-11-14 05:41:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2736 states have (on average 3.5515350877192984) internal successors, (9717), 2763 states have internal predecessors, (9717), 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) [2024-11-14 05:41:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 9717 transitions. [2024-11-14 05:41:42,424 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 9717 transitions. Word has length 16 [2024-11-14 05:41:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:42,424 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 9717 transitions. [2024-11-14 05:41:42,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 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) [2024-11-14 05:41:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 9717 transitions. [2024-11-14 05:41:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:41:42,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:42,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:42,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:41:42,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 05:41:42,632 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:42,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 62118196, now seen corresponding path program 1 times [2024-11-14 05:41:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292627153] [2024-11-14 05:41:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:43,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:43,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292627153] [2024-11-14 05:41:43,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292627153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:43,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414832834] [2024-11-14 05:41:43,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:43,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:43,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:43,082 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:43,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:41:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:43,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 05:41:43,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:43,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:43,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-14 05:41:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414832834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:43,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1604957332] [2024-11-14 05:41:43,821 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:43,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:43,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-14 05:41:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743528259] [2024-11-14 05:41:43,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:43,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:41:43,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:43,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:41:43,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:41:43,827 INFO L87 Difference]: Start difference. First operand 2764 states and 9717 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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) [2024-11-14 05:41:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:44,908 INFO L93 Difference]: Finished difference Result 3508 states and 11914 transitions. [2024-11-14 05:41:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:41:44,909 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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 [2024-11-14 05:41:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:44,935 INFO L225 Difference]: With dead ends: 3508 [2024-11-14 05:41:44,935 INFO L226 Difference]: Without dead ends: 3468 [2024-11-14 05:41:44,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:41:44,938 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 265 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:44,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 95 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:41:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2024-11-14 05:41:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 2973. [2024-11-14 05:41:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2973 states, 2945 states have (on average 3.52258064516129) internal successors, (10374), 2972 states have internal predecessors, (10374), 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) [2024-11-14 05:41:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 10374 transitions. [2024-11-14 05:41:45,038 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 10374 transitions. Word has length 16 [2024-11-14 05:41:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:45,039 INFO L471 AbstractCegarLoop]: Abstraction has 2973 states and 10374 transitions. [2024-11-14 05:41:45,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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) [2024-11-14 05:41:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 10374 transitions. [2024-11-14 05:41:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:41:45,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:45,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:45,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:41:45,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 05:41:45,245 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:45,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:45,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1936293134, now seen corresponding path program 2 times [2024-11-14 05:41:45,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:45,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275107979] [2024-11-14 05:41:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:41:45,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:45,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275107979] [2024-11-14 05:41:45,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275107979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:45,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387182763] [2024-11-14 05:41:45,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:41:45,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:45,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:45,599 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:45,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:41:45,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 05:41:45,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:41:45,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:41:45,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:45,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:41:45,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:41:45,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:41:45,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:41:45,911 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:41:45,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:41:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:41:46,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:41:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387182763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:46,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:41:46,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2024-11-14 05:41:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961512291] [2024-11-14 05:41:46,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:46,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:41:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:41:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:41:46,194 INFO L87 Difference]: Start difference. First operand 2973 states and 10374 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-11-14 05:41:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:46,705 INFO L93 Difference]: Finished difference Result 2973 states and 10374 transitions. [2024-11-14 05:41:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:41:46,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 [2024-11-14 05:41:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:46,731 INFO L225 Difference]: With dead ends: 2973 [2024-11-14 05:41:46,731 INFO L226 Difference]: Without dead ends: 2722 [2024-11-14 05:41:46,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:41:46,734 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 120 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:46,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 15 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:41:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2024-11-14 05:41:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2722. [2024-11-14 05:41:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2703 states have (on average 3.5020347761746207) internal successors, (9466), 2721 states have internal predecessors, (9466), 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) [2024-11-14 05:41:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 9466 transitions. [2024-11-14 05:41:46,818 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 9466 transitions. Word has length 17 [2024-11-14 05:41:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:46,819 INFO L471 AbstractCegarLoop]: Abstraction has 2722 states and 9466 transitions. [2024-11-14 05:41:46,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-11-14 05:41:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 9466 transitions. [2024-11-14 05:41:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:41:46,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:46,820 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 1, 1, 1] [2024-11-14 05:41:46,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:41:47,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:47,022 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:47,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1775112318, now seen corresponding path program 4 times [2024-11-14 05:41:47,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:47,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512656904] [2024-11-14 05:41:47,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:47,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:47,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512656904] [2024-11-14 05:41:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512656904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:47,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022541477] [2024-11-14 05:41:47,321 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:41:47,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:47,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:47,324 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:47,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 05:41:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:47,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:41:47,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:47,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:41:47,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022541477] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:47,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1052838509] [2024-11-14 05:41:47,895 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:47,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:47,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2024-11-14 05:41:47,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979212109] [2024-11-14 05:41:47,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:47,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:41:47,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:41:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:41:47,899 INFO L87 Difference]: Start difference. First operand 2722 states and 9466 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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) [2024-11-14 05:41:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:48,439 INFO L93 Difference]: Finished difference Result 6822 states and 24151 transitions. [2024-11-14 05:41:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:41:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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 18 [2024-11-14 05:41:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:48,474 INFO L225 Difference]: With dead ends: 6822 [2024-11-14 05:41:48,474 INFO L226 Difference]: Without dead ends: 4775 [2024-11-14 05:41:48,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 05:41:48,480 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 110 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:48,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 96 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:41:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-14 05:41:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 2729. [2024-11-14 05:41:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2710 states have (on average 3.496678966789668) internal successors, (9476), 2728 states have internal predecessors, (9476), 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) [2024-11-14 05:41:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 9476 transitions. [2024-11-14 05:41:48,588 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 9476 transitions. Word has length 18 [2024-11-14 05:41:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:48,589 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 9476 transitions. [2024-11-14 05:41:48,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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) [2024-11-14 05:41:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 9476 transitions. [2024-11-14 05:41:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:41:48,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:48,592 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:48,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-14 05:41:48,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 05:41:48,797 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:48,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash 93921856, now seen corresponding path program 2 times [2024-11-14 05:41:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:48,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390757246] [2024-11-14 05:41:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:41:49,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390757246] [2024-11-14 05:41:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390757246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170897512] [2024-11-14 05:41:49,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:41:49,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:49,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:49,221 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:49,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 05:41:49,359 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:41:49,360 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:41:49,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:41:49,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:49,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:41:49,476 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:41:49,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:41:49,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:41:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:41:49,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:50,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-14 05:41:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:41:50,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170897512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:50,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1356859615] [2024-11-14 05:41:50,385 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:50,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:50,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 19 [2024-11-14 05:41:50,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168014091] [2024-11-14 05:41:50,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:50,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:41:50,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:41:50,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:41:50,392 INFO L87 Difference]: Start difference. First operand 2729 states and 9476 transitions. Second operand has 21 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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) [2024-11-14 05:41:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:52,959 INFO L93 Difference]: Finished difference Result 3615 states and 12330 transitions. [2024-11-14 05:41:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:41:52,959 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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 18 [2024-11-14 05:41:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:52,986 INFO L225 Difference]: With dead ends: 3615 [2024-11-14 05:41:52,986 INFO L226 Difference]: Without dead ends: 3421 [2024-11-14 05:41:52,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 05:41:52,989 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 338 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:52,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 191 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:41:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2024-11-14 05:41:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 2535. [2024-11-14 05:41:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2522 states have (on average 3.486122125297383) internal successors, (8792), 2534 states have internal predecessors, (8792), 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) [2024-11-14 05:41:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 8792 transitions. [2024-11-14 05:41:53,082 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 8792 transitions. Word has length 18 [2024-11-14 05:41:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:53,083 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 8792 transitions. [2024-11-14 05:41:53,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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) [2024-11-14 05:41:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 8792 transitions. [2024-11-14 05:41:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:41:53,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:53,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:53,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 05:41:53,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:53,291 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:53,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash -104454139, now seen corresponding path program 1 times [2024-11-14 05:41:53,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:53,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092884593] [2024-11-14 05:41:53,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:41:53,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:53,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092884593] [2024-11-14 05:41:53,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092884593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:53,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72246773] [2024-11-14 05:41:53,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:53,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:53,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:53,692 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:53,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 05:41:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:53,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 05:41:53,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:41:54,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:54,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-14 05:41:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:41:54,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72246773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:54,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1643619706] [2024-11-14 05:41:54,192 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:54,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:54,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-14 05:41:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008574] [2024-11-14 05:41:54,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:54,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:41:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:41:54,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:41:54,199 INFO L87 Difference]: Start difference. First operand 2535 states and 8792 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 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) [2024-11-14 05:41:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:55,200 INFO L93 Difference]: Finished difference Result 4902 states and 17876 transitions. [2024-11-14 05:41:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:41:55,201 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 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 18 [2024-11-14 05:41:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:55,237 INFO L225 Difference]: With dead ends: 4902 [2024-11-14 05:41:55,237 INFO L226 Difference]: Without dead ends: 4675 [2024-11-14 05:41:55,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:41:55,245 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 165 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:55,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 117 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:41:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2024-11-14 05:41:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 4351. [2024-11-14 05:41:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4351 states, 4338 states have (on average 3.649147072383587) internal successors, (15830), 4350 states have internal predecessors, (15830), 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) [2024-11-14 05:41:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 15830 transitions. [2024-11-14 05:41:55,450 INFO L78 Accepts]: Start accepts. Automaton has 4351 states and 15830 transitions. Word has length 18 [2024-11-14 05:41:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:55,450 INFO L471 AbstractCegarLoop]: Abstraction has 4351 states and 15830 transitions. [2024-11-14 05:41:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 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) [2024-11-14 05:41:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4351 states and 15830 transitions. [2024-11-14 05:41:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:41:55,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:55,457 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:55,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 05:41:55,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:55,658 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:55,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1383388918, now seen corresponding path program 1 times [2024-11-14 05:41:55,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:55,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618309128] [2024-11-14 05:41:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:41:56,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618309128] [2024-11-14 05:41:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618309128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175601988] [2024-11-14 05:41:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:56,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:56,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:56,114 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:56,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 05:41:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:56,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 05:41:56,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:41:56,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:56,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-14 05:41:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:41:56,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175601988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:56,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1635693815] [2024-11-14 05:41:56,724 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:56,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:56,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2024-11-14 05:41:56,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420653274] [2024-11-14 05:41:56,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:56,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 05:41:56,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:56,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 05:41:56,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:41:56,727 INFO L87 Difference]: Start difference. First operand 4351 states and 15830 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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) [2024-11-14 05:41:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:57,866 INFO L93 Difference]: Finished difference Result 6219 states and 22860 transitions. [2024-11-14 05:41:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:41:57,867 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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 19 [2024-11-14 05:41:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:57,944 INFO L225 Difference]: With dead ends: 6219 [2024-11-14 05:41:57,944 INFO L226 Difference]: Without dead ends: 5833 [2024-11-14 05:41:57,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2024-11-14 05:41:57,948 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 200 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:57,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 202 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:41:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5833 states. [2024-11-14 05:41:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5833 to 5509. [2024-11-14 05:41:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 5496 states have (on average 3.7212518195050945) internal successors, (20452), 5508 states have internal predecessors, (20452), 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) [2024-11-14 05:41:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 20452 transitions. [2024-11-14 05:41:58,117 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 20452 transitions. Word has length 19 [2024-11-14 05:41:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:58,118 INFO L471 AbstractCegarLoop]: Abstraction has 5509 states and 20452 transitions. [2024-11-14 05:41:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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) [2024-11-14 05:41:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 20452 transitions. [2024-11-14 05:41:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:41:58,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:58,120 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1] [2024-11-14 05:41:58,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 05:41:58,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-14 05:41:58,320 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:41:58,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash -31740360, now seen corresponding path program 5 times [2024-11-14 05:41:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:58,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110054476] [2024-11-14 05:41:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:58,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:58,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:58,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110054476] [2024-11-14 05:41:58,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110054476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:58,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935810928] [2024-11-14 05:41:58,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:41:58,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:58,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:58,610 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:58,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 05:41:58,744 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:41:58,745 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:41:58,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:41:58,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:58,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:41:58,939 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:41:58,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 24 [2024-11-14 05:41:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 05:41:59,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 05:41:59,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935810928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:59,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [954137171] [2024-11-14 05:41:59,451 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:41:59,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:59,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 21 [2024-11-14 05:41:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457356708] [2024-11-14 05:41:59,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:59,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 05:41:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 05:41:59,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:41:59,453 INFO L87 Difference]: Start difference. First operand 5509 states and 20452 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 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) [2024-11-14 05:42:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:01,869 INFO L93 Difference]: Finished difference Result 10350 states and 38788 transitions. [2024-11-14 05:42:01,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 05:42:01,869 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 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 20 [2024-11-14 05:42:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:01,896 INFO L225 Difference]: With dead ends: 10350 [2024-11-14 05:42:01,896 INFO L226 Difference]: Without dead ends: 5524 [2024-11-14 05:42:01,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=794, Invalid=2176, Unknown=0, NotChecked=0, Total=2970 [2024-11-14 05:42:01,905 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 205 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:01,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 44 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:42:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2024-11-14 05:42:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5510. [2024-11-14 05:42:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5510 states, 5498 states have (on average 3.720261913423063) internal successors, (20454), 5509 states have internal predecessors, (20454), 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) [2024-11-14 05:42:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5510 states to 5510 states and 20454 transitions. [2024-11-14 05:42:02,068 INFO L78 Accepts]: Start accepts. Automaton has 5510 states and 20454 transitions. Word has length 20 [2024-11-14 05:42:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:02,068 INFO L471 AbstractCegarLoop]: Abstraction has 5510 states and 20454 transitions. [2024-11-14 05:42:02,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 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) [2024-11-14 05:42:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5510 states and 20454 transitions. [2024-11-14 05:42:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:42:02,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:02,071 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:02,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 05:42:02,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:02,272 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:02,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1599128792, now seen corresponding path program 2 times [2024-11-14 05:42:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:02,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175690135] [2024-11-14 05:42:02,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:02,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:02,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175690135] [2024-11-14 05:42:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175690135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569794275] [2024-11-14 05:42:02,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:42:02,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:02,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:02,473 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:02,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 05:42:02,691 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 05:42:02,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:42:02,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:42:02,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:02,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:42:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 05:42:02,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:42:02,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569794275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:02,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:42:02,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2024-11-14 05:42:02,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267773332] [2024-11-14 05:42:02,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:02,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:42:02,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:02,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:42:02,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:42:02,981 INFO L87 Difference]: Start difference. First operand 5510 states and 20454 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2024-11-14 05:42:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:03,295 INFO L93 Difference]: Finished difference Result 5510 states and 20454 transitions. [2024-11-14 05:42:03,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:42:03,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 20 [2024-11-14 05:42:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:03,322 INFO L225 Difference]: With dead ends: 5510 [2024-11-14 05:42:03,322 INFO L226 Difference]: Without dead ends: 5073 [2024-11-14 05:42:03,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:42:03,325 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 92 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:03,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 13 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:42:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2024-11-14 05:42:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 4864. [2024-11-14 05:42:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4864 states, 4856 states have (on average 3.742174629324547) internal successors, (18172), 4863 states have internal predecessors, (18172), 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) [2024-11-14 05:42:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4864 states to 4864 states and 18172 transitions. [2024-11-14 05:42:03,485 INFO L78 Accepts]: Start accepts. Automaton has 4864 states and 18172 transitions. Word has length 20 [2024-11-14 05:42:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:03,486 INFO L471 AbstractCegarLoop]: Abstraction has 4864 states and 18172 transitions. [2024-11-14 05:42:03,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2024-11-14 05:42:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4864 states and 18172 transitions. [2024-11-14 05:42:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:42:03,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:03,488 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:03,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 05:42:03,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:03,693 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:03,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash -390254342, now seen corresponding path program 1 times [2024-11-14 05:42:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:03,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851007075] [2024-11-14 05:42:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:03,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851007075] [2024-11-14 05:42:03,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851007075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869721129] [2024-11-14 05:42:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:03,891 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:03,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 05:42:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:04,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:42:04,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:04,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:04,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869721129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:42:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [627264934] [2024-11-14 05:42:04,312 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:42:04,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:04,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-14 05:42:04,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159854863] [2024-11-14 05:42:04,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:04,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:42:04,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:04,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:42:04,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:42:04,314 INFO L87 Difference]: Start difference. First operand 4864 states and 18172 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 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) [2024-11-14 05:42:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:04,651 INFO L93 Difference]: Finished difference Result 5115 states and 18877 transitions. [2024-11-14 05:42:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:42:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 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 20 [2024-11-14 05:42:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:04,675 INFO L225 Difference]: With dead ends: 5115 [2024-11-14 05:42:04,675 INFO L226 Difference]: Without dead ends: 4832 [2024-11-14 05:42:04,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:42:04,678 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 104 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:04,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 68 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:42:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2024-11-14 05:42:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4822. [2024-11-14 05:42:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4822 states, 4814 states have (on average 3.730162027420025) internal successors, (17957), 4821 states have internal predecessors, (17957), 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) [2024-11-14 05:42:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4822 states to 4822 states and 17957 transitions. [2024-11-14 05:42:04,814 INFO L78 Accepts]: Start accepts. Automaton has 4822 states and 17957 transitions. Word has length 20 [2024-11-14 05:42:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:04,815 INFO L471 AbstractCegarLoop]: Abstraction has 4822 states and 17957 transitions. [2024-11-14 05:42:04,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 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) [2024-11-14 05:42:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 4822 states and 17957 transitions. [2024-11-14 05:42:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:42:04,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:04,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:04,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 05:42:05,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:05,021 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:05,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1967837851, now seen corresponding path program 2 times [2024-11-14 05:42:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:05,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157559273] [2024-11-14 05:42:05,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:05,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:42:05,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:05,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157559273] [2024-11-14 05:42:05,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157559273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:05,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105700033] [2024-11-14 05:42:05,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:42:05,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:05,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:05,218 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:05,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 05:42:05,363 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 05:42:05,363 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:42:05,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:42:05,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:05,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:42:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:42:05,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:42:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105700033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:42:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [377740281] [2024-11-14 05:42:06,363 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:42:06,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:06,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2024-11-14 05:42:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677841725] [2024-11-14 05:42:06,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:42:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:06,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:42:06,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:42:06,366 INFO L87 Difference]: Start difference. First operand 4822 states and 17957 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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) [2024-11-14 05:42:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:08,475 INFO L93 Difference]: Finished difference Result 10734 states and 40215 transitions. [2024-11-14 05:42:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 05:42:08,476 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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 22 [2024-11-14 05:42:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:08,513 INFO L225 Difference]: With dead ends: 10734 [2024-11-14 05:42:08,514 INFO L226 Difference]: Without dead ends: 8791 [2024-11-14 05:42:08,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 05:42:08,520 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 391 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:08,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 256 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 05:42:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2024-11-14 05:42:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 5175. [2024-11-14 05:42:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5175 states, 5171 states have (on average 3.7222974279636434) internal successors, (19248), 5174 states have internal predecessors, (19248), 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) [2024-11-14 05:42:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 19248 transitions. [2024-11-14 05:42:08,676 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 19248 transitions. Word has length 22 [2024-11-14 05:42:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:08,676 INFO L471 AbstractCegarLoop]: Abstraction has 5175 states and 19248 transitions. [2024-11-14 05:42:08,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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) [2024-11-14 05:42:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 19248 transitions. [2024-11-14 05:42:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:42:08,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:08,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:08,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 05:42:08,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:08,880 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:08,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash -522224545, now seen corresponding path program 2 times [2024-11-14 05:42:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:08,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838052477] [2024-11-14 05:42:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:08,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:42:09,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838052477] [2024-11-14 05:42:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838052477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30235922] [2024-11-14 05:42:09,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:42:09,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:09,278 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:09,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 05:42:09,437 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:42:09,437 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:42:09,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:42:09,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:09,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:42:09,553 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:42:09,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-14 05:42:09,573 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:42:09,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:42:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:42:09,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:10,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-14 05:42:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:42:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30235922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:42:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656258211] [2024-11-14 05:42:10,826 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:42:10,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:10,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2024-11-14 05:42:10,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959001190] [2024-11-14 05:42:10,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:10,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:42:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:10,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:42:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:42:10,830 INFO L87 Difference]: Start difference. First operand 5175 states and 19248 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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) [2024-11-14 05:42:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:11,838 INFO L93 Difference]: Finished difference Result 6474 states and 24120 transitions. [2024-11-14 05:42:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:42:11,839 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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 24 [2024-11-14 05:42:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:11,866 INFO L225 Difference]: With dead ends: 6474 [2024-11-14 05:42:11,866 INFO L226 Difference]: Without dead ends: 6041 [2024-11-14 05:42:11,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2024-11-14 05:42:11,869 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 205 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:11,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 86 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:42:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2024-11-14 05:42:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3876. [2024-11-14 05:42:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3874 states have (on average 3.599122354155911) internal successors, (13943), 3875 states have internal predecessors, (13943), 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) [2024-11-14 05:42:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 13943 transitions. [2024-11-14 05:42:11,971 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 13943 transitions. Word has length 24 [2024-11-14 05:42:11,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:11,971 INFO L471 AbstractCegarLoop]: Abstraction has 3876 states and 13943 transitions. [2024-11-14 05:42:11,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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) [2024-11-14 05:42:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 13943 transitions. [2024-11-14 05:42:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:42:11,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:11,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:12,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-14 05:42:12,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:12,176 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:12,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:12,177 INFO L85 PathProgramCache]: Analyzing trace with hash -635462096, now seen corresponding path program 1 times [2024-11-14 05:42:12,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:12,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285145532] [2024-11-14 05:42:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:12,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:42:12,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:12,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285145532] [2024-11-14 05:42:12,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285145532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:12,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:12,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:42:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748731118] [2024-11-14 05:42:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:12,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:42:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:42:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:42:12,223 INFO L87 Difference]: Start difference. First operand 3876 states and 13943 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2024-11-14 05:42:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:12,338 INFO L93 Difference]: Finished difference Result 4673 states and 16598 transitions. [2024-11-14 05:42:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:42:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2024-11-14 05:42:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:12,372 INFO L225 Difference]: With dead ends: 4673 [2024-11-14 05:42:12,372 INFO L226 Difference]: Without dead ends: 4660 [2024-11-14 05:42:12,374 INFO L431 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 [2024-11-14 05:42:12,375 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:12,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:42:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4660 states. [2024-11-14 05:42:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4660 to 4024. [2024-11-14 05:42:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4024 states, 4022 states have (on average 3.5765788165091994) internal successors, (14385), 4023 states have internal predecessors, (14385), 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) [2024-11-14 05:42:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4024 states to 4024 states and 14385 transitions. [2024-11-14 05:42:12,477 INFO L78 Accepts]: Start accepts. Automaton has 4024 states and 14385 transitions. Word has length 24 [2024-11-14 05:42:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:12,478 INFO L471 AbstractCegarLoop]: Abstraction has 4024 states and 14385 transitions. [2024-11-14 05:42:12,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2024-11-14 05:42:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4024 states and 14385 transitions. [2024-11-14 05:42:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:42:12,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:12,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-14 05:42:12,485 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:12,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:12,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1452792617, now seen corresponding path program 1 times [2024-11-14 05:42:12,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551145027] [2024-11-14 05:42:12,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:42:12,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551145027] [2024-11-14 05:42:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551145027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:12,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:42:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787987930] [2024-11-14 05:42:12,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:12,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:42:12,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:12,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:42:12,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:42:12,553 INFO L87 Difference]: Start difference. First operand 4024 states and 14385 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-11-14 05:42:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:12,693 INFO L93 Difference]: Finished difference Result 4887 states and 17572 transitions. [2024-11-14 05:42:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:42:12,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-14 05:42:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:12,726 INFO L225 Difference]: With dead ends: 4887 [2024-11-14 05:42:12,727 INFO L226 Difference]: Without dead ends: 4403 [2024-11-14 05:42:12,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:42:12,730 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:12,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 15 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:42:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2024-11-14 05:42:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 4309. [2024-11-14 05:42:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4309 states, 4307 states have (on average 3.6050615277455305) internal successors, (15527), 4308 states have internal predecessors, (15527), 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) [2024-11-14 05:42:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4309 states to 4309 states and 15527 transitions. [2024-11-14 05:42:12,910 INFO L78 Accepts]: Start accepts. Automaton has 4309 states and 15527 transitions. Word has length 27 [2024-11-14 05:42:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:12,911 INFO L471 AbstractCegarLoop]: Abstraction has 4309 states and 15527 transitions. [2024-11-14 05:42:12,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-11-14 05:42:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4309 states and 15527 transitions. [2024-11-14 05:42:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:42:12,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:12,918 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:12,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-14 05:42:12,918 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:12,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash 116442597, now seen corresponding path program 1 times [2024-11-14 05:42:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:12,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180709782] [2024-11-14 05:42:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:12,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:42:13,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180709782] [2024-11-14 05:42:13,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180709782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30956365] [2024-11-14 05:42:13,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:13,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:13,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:13,134 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:13,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 05:42:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:13,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:42:13,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:42:13,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:42:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30956365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:42:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1361883135] [2024-11-14 05:42:13,634 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:42:13,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:13,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-11-14 05:42:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765213219] [2024-11-14 05:42:13,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:13,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:42:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:42:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:42:13,636 INFO L87 Difference]: Start difference. First operand 4309 states and 15527 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 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) [2024-11-14 05:42:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:14,224 INFO L93 Difference]: Finished difference Result 4921 states and 17139 transitions. [2024-11-14 05:42:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:42:14,225 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 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 28 [2024-11-14 05:42:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:14,252 INFO L225 Difference]: With dead ends: 4921 [2024-11-14 05:42:14,252 INFO L226 Difference]: Without dead ends: 3380 [2024-11-14 05:42:14,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:42:14,257 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 172 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:14,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 112 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:42:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2024-11-14 05:42:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3330. [2024-11-14 05:42:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3330 states, 3328 states have (on average 3.4435096153846154) internal successors, (11460), 3329 states have internal predecessors, (11460), 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) [2024-11-14 05:42:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 11460 transitions. [2024-11-14 05:42:14,359 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 11460 transitions. Word has length 28 [2024-11-14 05:42:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:14,360 INFO L471 AbstractCegarLoop]: Abstraction has 3330 states and 11460 transitions. [2024-11-14 05:42:14,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 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) [2024-11-14 05:42:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 11460 transitions. [2024-11-14 05:42:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:42:14,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:14,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:14,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 05:42:14,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 05:42:14,567 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:14,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1794054006, now seen corresponding path program 1 times [2024-11-14 05:42:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916999228] [2024-11-14 05:42:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:42:14,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916999228] [2024-11-14 05:42:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916999228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412057803] [2024-11-14 05:42:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:14,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:14,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:14,686 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:14,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 05:42:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:14,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:42:14,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:42:14,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:42:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412057803] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:14,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:42:14,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2024-11-14 05:42:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860991544] [2024-11-14 05:42:14,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:14,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:42:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:42:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:42:14,948 INFO L87 Difference]: Start difference. First operand 3330 states and 11460 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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) [2024-11-14 05:42:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:15,084 INFO L93 Difference]: Finished difference Result 4318 states and 14637 transitions. [2024-11-14 05:42:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:42:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-11-14 05:42:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:15,112 INFO L225 Difference]: With dead ends: 4318 [2024-11-14 05:42:15,112 INFO L226 Difference]: Without dead ends: 3624 [2024-11-14 05:42:15,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:42:15,116 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:15,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 20 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:42:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2024-11-14 05:42:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 3624. [2024-11-14 05:42:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3622 states have (on average 3.3964660408614025) internal successors, (12302), 3623 states have internal predecessors, (12302), 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) [2024-11-14 05:42:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 12302 transitions. [2024-11-14 05:42:15,214 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 12302 transitions. Word has length 29 [2024-11-14 05:42:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:15,214 INFO L471 AbstractCegarLoop]: Abstraction has 3624 states and 12302 transitions. [2024-11-14 05:42:15,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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) [2024-11-14 05:42:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 12302 transitions. [2024-11-14 05:42:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:42:15,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:15,221 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:15,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-14 05:42:15,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:15,422 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:15,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:15,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1247296374, now seen corresponding path program 2 times [2024-11-14 05:42:15,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:15,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852548662] [2024-11-14 05:42:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:42:15,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852548662] [2024-11-14 05:42:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852548662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127643284] [2024-11-14 05:42:15,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:42:15,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:15,710 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:15,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 05:42:15,869 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 05:42:15,869 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:42:15,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:42:15,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:15,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:42:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-14 05:42:16,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-14 05:42:17,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127643284] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:42:17,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1180941830] [2024-11-14 05:42:17,145 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:42:17,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:17,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 20 [2024-11-14 05:42:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975419638] [2024-11-14 05:42:17,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:17,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:42:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:42:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:42:17,147 INFO L87 Difference]: Start difference. First operand 3624 states and 12302 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 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) [2024-11-14 05:42:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:19,022 INFO L93 Difference]: Finished difference Result 5890 states and 20278 transitions. [2024-11-14 05:42:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:42:19,022 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 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 32 [2024-11-14 05:42:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:19,048 INFO L225 Difference]: With dead ends: 5890 [2024-11-14 05:42:19,048 INFO L226 Difference]: Without dead ends: 5067 [2024-11-14 05:42:19,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=258, Invalid=1224, Unknown=0, NotChecked=0, Total=1482 [2024-11-14 05:42:19,051 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 488 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:19,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 112 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:42:19,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2024-11-14 05:42:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 3833. [2024-11-14 05:42:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 3832 states have (on average 3.414926931106472) internal successors, (13086), 3832 states have internal predecessors, (13086), 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) [2024-11-14 05:42:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 13086 transitions. [2024-11-14 05:42:19,147 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 13086 transitions. Word has length 32 [2024-11-14 05:42:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:19,147 INFO L471 AbstractCegarLoop]: Abstraction has 3833 states and 13086 transitions. [2024-11-14 05:42:19,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 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) [2024-11-14 05:42:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 13086 transitions. [2024-11-14 05:42:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:42:19,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:19,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:19,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-14 05:42:19,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:19,354 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:42:19,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash 769603045, now seen corresponding path program 1 times [2024-11-14 05:42:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871678210] [2024-11-14 05:42:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:20,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871678210] [2024-11-14 05:42:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871678210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062581949] [2024-11-14 05:42:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:20,254 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:20,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-14 05:42:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:20,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 05:42:20,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:20,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:42:20,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:42:20,542 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:42:20,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:42:20,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:42:21,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:42:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:21,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:25,997 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2024-11-14 05:42:25,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1578 treesize of output 1148 [2024-11-14 05:42:26,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:26,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 809 treesize of output 749 [2024-11-14 05:42:29,869 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 05:42:48,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:48,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2024-11-14 05:42:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062581949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:42:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [878042688] [2024-11-14 05:42:50,520 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:42:50,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:50,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2024-11-14 05:42:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439914093] [2024-11-14 05:42:50,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:50,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:42:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:50,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:42:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=938, Unknown=3, NotChecked=0, Total=1056 [2024-11-14 05:42:50,524 INFO L87 Difference]: Start difference. First operand 3833 states and 13086 transitions. Second operand has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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) [2024-11-14 05:42:56,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:42:58,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:01,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:03,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:08,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:10,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:12,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:19,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:21,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:23,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:26,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:28,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:30,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:43:32,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:43:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:33,813 INFO L93 Difference]: Finished difference Result 4725 states and 15996 transitions. [2024-11-14 05:43:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:43:33,813 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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 32 [2024-11-14 05:43:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:33,837 INFO L225 Difference]: With dead ends: 4725 [2024-11-14 05:43:33,837 INFO L226 Difference]: Without dead ends: 4642 [2024-11-14 05:43:33,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=298, Invalid=1765, Unknown=7, NotChecked=0, Total=2070 [2024-11-14 05:43:33,839 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 182 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 12 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:33,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 59 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1771 Invalid, 14 Unknown, 0 Unchecked, 32.4s Time] [2024-11-14 05:43:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4642 states. [2024-11-14 05:43:33,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4642 to 3908. [2024-11-14 05:43:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3907 states have (on average 3.402610698745841) internal successors, (13294), 3907 states have internal predecessors, (13294), 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) [2024-11-14 05:43:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 13294 transitions. [2024-11-14 05:43:33,967 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 13294 transitions. Word has length 32 [2024-11-14 05:43:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:33,967 INFO L471 AbstractCegarLoop]: Abstraction has 3908 states and 13294 transitions. [2024-11-14 05:43:33,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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) [2024-11-14 05:43:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 13294 transitions. [2024-11-14 05:43:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:43:33,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:33,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:33,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-14 05:43:34,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-14 05:43:34,174 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:43:34,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1212627655, now seen corresponding path program 2 times [2024-11-14 05:43:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:34,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702175267] [2024-11-14 05:43:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:35,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:35,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702175267] [2024-11-14 05:43:35,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702175267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:35,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117177784] [2024-11-14 05:43:35,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:43:35,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:35,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:35,090 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:35,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 05:43:35,226 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:43:35,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:43:35,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:43:35,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:35,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:43:36,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:36,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:43:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:36,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:36,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:36,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2024-11-14 05:43:37,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:37,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 313 [2024-11-14 05:43:37,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:37,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 192 [2024-11-14 05:43:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:37,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117177784] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:43:37,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1466123922] [2024-11-14 05:43:37,503 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:43:37,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:43:37,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2024-11-14 05:43:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379991158] [2024-11-14 05:43:37,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:43:37,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 05:43:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:37,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 05:43:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2024-11-14 05:43:37,505 INFO L87 Difference]: Start difference. First operand 3908 states and 13294 transitions. Second operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 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) [2024-11-14 05:43:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:40,224 INFO L93 Difference]: Finished difference Result 4773 states and 16142 transitions. [2024-11-14 05:43:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 05:43:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 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 32 [2024-11-14 05:43:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:40,243 INFO L225 Difference]: With dead ends: 4773 [2024-11-14 05:43:40,243 INFO L226 Difference]: Without dead ends: 4706 [2024-11-14 05:43:40,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2024-11-14 05:43:40,246 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 261 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:40,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 48 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 05:43:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2024-11-14 05:43:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 3950. [2024-11-14 05:43:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3950 states, 3949 states have (on average 3.3985819194732843) internal successors, (13421), 3949 states have internal predecessors, (13421), 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) [2024-11-14 05:43:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 13421 transitions. [2024-11-14 05:43:40,323 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 13421 transitions. Word has length 32 [2024-11-14 05:43:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:40,323 INFO L471 AbstractCegarLoop]: Abstraction has 3950 states and 13421 transitions. [2024-11-14 05:43:40,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 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) [2024-11-14 05:43:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 13421 transitions. [2024-11-14 05:43:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:43:40,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:40,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:40,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-14 05:43:40,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-14 05:43:40,528 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:43:40,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1922325553, now seen corresponding path program 3 times [2024-11-14 05:43:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:40,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372013665] [2024-11-14 05:43:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:41,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372013665] [2024-11-14 05:43:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372013665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710594042] [2024-11-14 05:43:41,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:43:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:41,311 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:41,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 05:43:41,431 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:43:41,431 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:43:41,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-14 05:43:41,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:41,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:43:42,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:42,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:43:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:42,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:42,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:42,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2024-11-14 05:43:42,959 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:42,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:42,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 83 [2024-11-14 05:43:43,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:43,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:43,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 118 [2024-11-14 05:43:43,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:43,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2024-11-14 05:43:43,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:43,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 260 [2024-11-14 05:43:43,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:43,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 192 [2024-11-14 05:43:43,485 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-14 05:43:43,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 139 [2024-11-14 05:43:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710594042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:43:43,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [972492585] [2024-11-14 05:43:43,788 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:43:43,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:43:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 31 [2024-11-14 05:43:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984437841] [2024-11-14 05:43:43,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:43:43,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 05:43:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 05:43:43,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2024-11-14 05:43:43,789 INFO L87 Difference]: Start difference. First operand 3950 states and 13421 transitions. Second operand has 32 states, 32 states have (on average 2.5) internal successors, (80), 31 states have internal predecessors, (80), 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) [2024-11-14 05:43:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:45,536 INFO L93 Difference]: Finished difference Result 4675 states and 15831 transitions. [2024-11-14 05:43:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:43:45,537 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.5) internal successors, (80), 31 states have internal predecessors, (80), 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 32 [2024-11-14 05:43:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:45,555 INFO L225 Difference]: With dead ends: 4675 [2024-11-14 05:43:45,556 INFO L226 Difference]: Without dead ends: 4594 [2024-11-14 05:43:45,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 05:43:45,558 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 165 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:45,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 44 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:43:45,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2024-11-14 05:43:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 3962. [2024-11-14 05:43:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3961 states have (on average 3.3963645544054533) internal successors, (13453), 3961 states have internal predecessors, (13453), 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) [2024-11-14 05:43:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 13453 transitions. [2024-11-14 05:43:45,685 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 13453 transitions. Word has length 32 [2024-11-14 05:43:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:45,686 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 13453 transitions. [2024-11-14 05:43:45,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.5) internal successors, (80), 31 states have internal predecessors, (80), 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) [2024-11-14 05:43:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 13453 transitions. [2024-11-14 05:43:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:43:45,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:45,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:45,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 05:43:45,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-14 05:43:45,893 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:43:45,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash 798018289, now seen corresponding path program 4 times [2024-11-14 05:43:45,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:45,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899984851] [2024-11-14 05:43:45,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:46,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899984851] [2024-11-14 05:43:46,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899984851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047326978] [2024-11-14 05:43:46,931 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:43:46,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:46,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:46,933 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:46,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-14 05:43:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:47,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:43:47,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:47,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:43:47,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:47,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:43:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:47,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:48,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:48,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2024-11-14 05:43:48,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:48,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 260 [2024-11-14 05:43:48,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:48,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 192 [2024-11-14 05:43:48,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:48,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 144 [2024-11-14 05:43:49,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:49,086 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:49,088 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:43:49,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2024-11-14 05:43:49,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,152 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:43:49,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 1 [2024-11-14 05:43:49,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2024-11-14 05:43:49,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 50 [2024-11-14 05:43:49,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 178 [2024-11-14 05:43:49,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 110 [2024-11-14 05:43:49,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2024-11-14 05:43:49,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 50 [2024-11-14 05:43:49,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 162 [2024-11-14 05:43:49,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 110 [2024-11-14 05:43:49,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 178 [2024-11-14 05:43:49,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 110 [2024-11-14 05:43:49,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 295 [2024-11-14 05:43:49,475 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:43:49,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:49,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 227 [2024-11-14 05:43:49,514 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:43:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047326978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:43:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335337887] [2024-11-14 05:43:49,855 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:43:49,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:43:49,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2024-11-14 05:43:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224791803] [2024-11-14 05:43:49,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:43:49,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:43:49,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:43:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 05:43:49,857 INFO L87 Difference]: Start difference. First operand 3962 states and 13453 transitions. Second operand has 36 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 35 states have internal predecessors, (87), 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) [2024-11-14 05:43:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:53,388 INFO L93 Difference]: Finished difference Result 6101 states and 20335 transitions. [2024-11-14 05:43:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 05:43:53,388 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 35 states have internal predecessors, (87), 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 32 [2024-11-14 05:43:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:53,441 INFO L225 Difference]: With dead ends: 6101 [2024-11-14 05:43:53,441 INFO L226 Difference]: Without dead ends: 5955 [2024-11-14 05:43:53,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=377, Invalid=2703, Unknown=0, NotChecked=0, Total=3080 [2024-11-14 05:43:53,442 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 337 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2664 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:53,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 131 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2664 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-14 05:43:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2024-11-14 05:43:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 4606. [2024-11-14 05:43:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4606 states, 4605 states have (on average 3.3648208469055376) internal successors, (15495), 4605 states have internal predecessors, (15495), 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) [2024-11-14 05:43:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 15495 transitions. [2024-11-14 05:43:53,538 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 15495 transitions. Word has length 32 [2024-11-14 05:43:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:53,538 INFO L471 AbstractCegarLoop]: Abstraction has 4606 states and 15495 transitions. [2024-11-14 05:43:53,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 35 states have internal predecessors, (87), 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) [2024-11-14 05:43:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 15495 transitions. [2024-11-14 05:43:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:43:53,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:53,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:53,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-14 05:43:53,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:53,747 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:43:53,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1551508175, now seen corresponding path program 5 times [2024-11-14 05:43:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:53,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996395998] [2024-11-14 05:43:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:54,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:54,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996395998] [2024-11-14 05:43:54,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996395998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:54,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370282334] [2024-11-14 05:43:54,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:43:54,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:54,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:54,490 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:54,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-14 05:43:54,616 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:43:54,616 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:43:54,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-14 05:43:54,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:54,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:43:55,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:55,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:43:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:55,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:43:55,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370282334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:43:55,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [554750033] [2024-11-14 05:43:55,905 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:43:55,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:43:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 29 [2024-11-14 05:43:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782894832] [2024-11-14 05:43:55,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:43:55,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 05:43:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 05:43:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2024-11-14 05:43:55,907 INFO L87 Difference]: Start difference. First operand 4606 states and 15495 transitions. Second operand has 30 states, 30 states have (on average 2.8) internal successors, (84), 29 states have internal predecessors, (84), 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) [2024-11-14 05:43:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:58,925 INFO L93 Difference]: Finished difference Result 8167 states and 27160 transitions. [2024-11-14 05:43:58,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-14 05:43:58,926 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8) internal successors, (84), 29 states have internal predecessors, (84), 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 32 [2024-11-14 05:43:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:58,994 INFO L225 Difference]: With dead ends: 8167 [2024-11-14 05:43:58,994 INFO L226 Difference]: Without dead ends: 7995 [2024-11-14 05:43:58,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=272, Invalid=1890, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 05:43:58,996 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 464 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:58,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 38 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-14 05:43:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7995 states. [2024-11-14 05:43:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7995 to 4699. [2024-11-14 05:43:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4699 states, 4698 states have (on average 3.3601532567049808) internal successors, (15786), 4698 states have internal predecessors, (15786), 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) [2024-11-14 05:43:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 15786 transitions. [2024-11-14 05:43:59,102 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 15786 transitions. Word has length 32 [2024-11-14 05:43:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:59,102 INFO L471 AbstractCegarLoop]: Abstraction has 4699 states and 15786 transitions. [2024-11-14 05:43:59,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8) internal successors, (84), 29 states have internal predecessors, (84), 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) [2024-11-14 05:43:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 15786 transitions. [2024-11-14 05:43:59,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:43:59,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:59,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:59,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-14 05:43:59,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-14 05:43:59,308 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:43:59,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1540527327, now seen corresponding path program 6 times [2024-11-14 05:43:59,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:59,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892573044] [2024-11-14 05:43:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:44:00,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:00,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892573044] [2024-11-14 05:44:00,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892573044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:00,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233578637] [2024-11-14 05:44:00,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:44:00,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:00,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:44:00,120 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:44:00,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 05:44:00,244 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:44:00,244 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:44:00,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:44:00,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:00,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:44:00,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:00,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:44:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:44:00,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:44:01,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:01,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2024-11-14 05:44:01,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:01,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 260 [2024-11-14 05:44:01,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:01,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 196 [2024-11-14 05:44:02,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:02,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2024-11-14 05:44:02,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:02,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 50 [2024-11-14 05:44:02,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:02,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 162 [2024-11-14 05:44:02,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:02,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 110 [2024-11-14 05:44:02,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:02,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 190 [2024-11-14 05:44:02,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:02,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 134 [2024-11-14 05:44:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:44:02,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233578637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:44:02,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1656723760] [2024-11-14 05:44:02,428 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:44:02,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:44:02,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 29 [2024-11-14 05:44:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482777164] [2024-11-14 05:44:02,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:44:02,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 05:44:02,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:02,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 05:44:02,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2024-11-14 05:44:02,430 INFO L87 Difference]: Start difference. First operand 4699 states and 15786 transitions. Second operand has 30 states, 30 states have (on average 2.8) internal successors, (84), 29 states have internal predecessors, (84), 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) [2024-11-14 05:44:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:04,641 INFO L93 Difference]: Finished difference Result 5310 states and 17797 transitions. [2024-11-14 05:44:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:44:04,641 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8) internal successors, (84), 29 states have internal predecessors, (84), 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 32 [2024-11-14 05:44:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:04,664 INFO L225 Difference]: With dead ends: 5310 [2024-11-14 05:44:04,664 INFO L226 Difference]: Without dead ends: 5227 [2024-11-14 05:44:04,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2024-11-14 05:44:04,667 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 148 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:04,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 50 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 05:44:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5227 states. [2024-11-14 05:44:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5227 to 4777. [2024-11-14 05:44:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4777 states, 4776 states have (on average 3.351968174204355) internal successors, (16009), 4776 states have internal predecessors, (16009), 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) [2024-11-14 05:44:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 16009 transitions. [2024-11-14 05:44:04,775 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 16009 transitions. Word has length 32 [2024-11-14 05:44:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:04,775 INFO L471 AbstractCegarLoop]: Abstraction has 4777 states and 16009 transitions. [2024-11-14 05:44:04,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8) internal successors, (84), 29 states have internal predecessors, (84), 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) [2024-11-14 05:44:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 16009 transitions. [2024-11-14 05:44:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:44:04,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:04,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:04,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 05:44:04,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:04,982 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:44:04,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1601717461, now seen corresponding path program 7 times [2024-11-14 05:44:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:04,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448736986] [2024-11-14 05:44:04,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:44:06,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:06,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448736986] [2024-11-14 05:44:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448736986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:06,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374627342] [2024-11-14 05:44:06,185 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:44:06,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:06,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:44:06,187 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:44:06,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-14 05:44:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:06,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 05:44:06,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:06,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:44:06,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:44:06,486 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:44:06,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:44:06,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:44:07,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:44:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:44:07,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:44:13,767 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2024-11-14 05:44:13,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1682 treesize of output 1252 [2024-11-14 05:44:13,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:13,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 754 treesize of output 704 [2024-11-14 05:44:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:44:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374627342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:44:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1951650817] [2024-11-14 05:44:17,994 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:44:17,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:44:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2024-11-14 05:44:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136063763] [2024-11-14 05:44:17,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:44:17,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:44:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:17,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:44:17,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1129, Unknown=3, NotChecked=0, Total=1260 [2024-11-14 05:44:17,996 INFO L87 Difference]: Start difference. First operand 4777 states and 16009 transitions. Second operand has 36 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 35 states have internal predecessors, (80), 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) [2024-11-14 05:44:29,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:44:31,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:44:33,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:44:35,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:44:38,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:44:43,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:44:45,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:44:54,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:44:56,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:45:01,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:45:04,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:45:06,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:45:09,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:45:12,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:45:14,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:45:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:16,070 INFO L93 Difference]: Finished difference Result 5398 states and 18069 transitions. [2024-11-14 05:45:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:45:16,071 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 35 states have internal predecessors, (80), 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 32 [2024-11-14 05:45:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:16,126 INFO L225 Difference]: With dead ends: 5398 [2024-11-14 05:45:16,126 INFO L226 Difference]: Without dead ends: 5311 [2024-11-14 05:45:16,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=332, Invalid=1913, Unknown=11, NotChecked=0, Total=2256 [2024-11-14 05:45:16,128 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 217 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 12 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:16,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 53 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1600 Invalid, 15 Unknown, 0 Unchecked, 39.1s Time] [2024-11-14 05:45:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2024-11-14 05:45:16,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4795. [2024-11-14 05:45:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4795 states, 4794 states have (on average 3.350020859407593) internal successors, (16060), 4794 states have internal predecessors, (16060), 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) [2024-11-14 05:45:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4795 states and 16060 transitions. [2024-11-14 05:45:16,202 INFO L78 Accepts]: Start accepts. Automaton has 4795 states and 16060 transitions. Word has length 32 [2024-11-14 05:45:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:16,202 INFO L471 AbstractCegarLoop]: Abstraction has 4795 states and 16060 transitions. [2024-11-14 05:45:16,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 35 states have internal predecessors, (80), 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) [2024-11-14 05:45:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4795 states and 16060 transitions. [2024-11-14 05:45:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:45:16,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:16,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:45:16,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-14 05:45:16,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-14 05:45:16,408 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:45:16,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1855103265, now seen corresponding path program 8 times [2024-11-14 05:45:16,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:16,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408129643] [2024-11-14 05:45:16,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:16,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:45:18,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:18,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408129643] [2024-11-14 05:45:18,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408129643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:45:18,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602963521] [2024-11-14 05:45:18,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:45:18,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:45:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:45:18,334 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:45:18,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-14 05:45:18,460 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:45:18,460 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:45:18,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-14 05:45:18,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:45:18,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:45:21,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:21,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:45:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:45:21,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:45:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:45:22,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602963521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:45:22,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [999747419] [2024-11-14 05:45:22,757 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:45:22,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:45:22,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2024-11-14 05:45:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881819899] [2024-11-14 05:45:22,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:45:22,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:45:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:22,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:45:22,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:45:22,759 INFO L87 Difference]: Start difference. First operand 4795 states and 16060 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 30 states have internal predecessors, (84), 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) [2024-11-14 05:45:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:34,063 INFO L93 Difference]: Finished difference Result 8752 states and 29267 transitions. [2024-11-14 05:45:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 05:45:34,063 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 30 states have internal predecessors, (84), 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 32 [2024-11-14 05:45:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:34,092 INFO L225 Difference]: With dead ends: 8752 [2024-11-14 05:45:34,092 INFO L226 Difference]: Without dead ends: 8628 [2024-11-14 05:45:34,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=265, Invalid=1897, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 05:45:34,095 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 344 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:34,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 110 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-14 05:45:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2024-11-14 05:45:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 4919. [2024-11-14 05:45:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4919 states, 4918 states have (on average 3.3538023586823913) internal successors, (16494), 4918 states have internal predecessors, (16494), 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) [2024-11-14 05:45:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 16494 transitions. [2024-11-14 05:45:34,255 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 16494 transitions. Word has length 32 [2024-11-14 05:45:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:34,255 INFO L471 AbstractCegarLoop]: Abstraction has 4919 states and 16494 transitions. [2024-11-14 05:45:34,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 30 states have internal predecessors, (84), 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) [2024-11-14 05:45:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 16494 transitions. [2024-11-14 05:45:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:45:34,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:34,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:45:34,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-14 05:45:34,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-14 05:45:34,461 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:45:34,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1173003301, now seen corresponding path program 9 times [2024-11-14 05:45:34,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:34,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253173200] [2024-11-14 05:45:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:34,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:45:36,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253173200] [2024-11-14 05:45:36,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253173200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:45:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955529427] [2024-11-14 05:45:36,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:45:36,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:45:36,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:45:36,539 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:45:36,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-14 05:45:36,668 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:45:36,668 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:45:36,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:45:36,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:45:37,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:45:38,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:38,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:45:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:45:39,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:45:40,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:40,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2024-11-14 05:45:41,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:41,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 300 treesize of output 244 [2024-11-14 05:45:44,591 INFO L349 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2024-11-14 05:45:44,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 140 [2024-11-14 05:45:44,692 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:45:44,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:44,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 83 [2024-11-14 05:45:45,061 INFO L349 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2024-11-14 05:45:45,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 71 [2024-11-14 05:45:45,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:45,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 122 [2024-11-14 05:45:45,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2024-11-14 05:45:45,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,484 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:45:45,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 267 treesize of output 1 [2024-11-14 05:45:45,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,553 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:45:45,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 1 [2024-11-14 05:45:45,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,617 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:45:45,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 369 treesize of output 1 [2024-11-14 05:45:45,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,682 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:45:45,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 1 [2024-11-14 05:45:45,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,751 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:45:45,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 283 treesize of output 1 [2024-11-14 05:45:45,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,814 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:45:45,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 1 [2024-11-14 05:45:45,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 246 [2024-11-14 05:45:45,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 170 [2024-11-14 05:45:45,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 211 [2024-11-14 05:45:45,965 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:45:45,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 178 [2024-11-14 05:45:46,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:46,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 110 [2024-11-14 05:45:46,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:46,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2024-11-14 05:45:46,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:46,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 50 [2024-11-14 05:45:46,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:46,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 143 [2024-11-14 05:45:46,180 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:45:46,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:46,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 227 [2024-11-14 05:45:46,228 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:45:46,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:46,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 295 [2024-11-14 05:45:46,279 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:45:46,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:46,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 162 [2024-11-14 05:45:46,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:46,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 110 [2024-11-14 05:45:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:45:47,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955529427] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:45:47,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1700716348] [2024-11-14 05:45:47,253 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:45:47,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:45:47,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 30 [2024-11-14 05:45:47,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026492014] [2024-11-14 05:45:47,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:45:47,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:45:47,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:47,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:45:47,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:45:47,256 INFO L87 Difference]: Start difference. First operand 4919 states and 16494 transitions. Second operand has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 30 states have internal predecessors, (78), 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) [2024-11-14 05:45:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:55,305 INFO L93 Difference]: Finished difference Result 5458 states and 18295 transitions. [2024-11-14 05:45:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:45:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 30 states have internal predecessors, (78), 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 32 [2024-11-14 05:45:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:55,326 INFO L225 Difference]: With dead ends: 5458 [2024-11-14 05:45:55,327 INFO L226 Difference]: Without dead ends: 5373 [2024-11-14 05:45:55,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 05:45:55,329 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 154 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:55,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 59 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-14 05:45:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5373 states. [2024-11-14 05:45:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5373 to 4901. [2024-11-14 05:45:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4901 states, 4900 states have (on average 3.356938775510204) internal successors, (16449), 4900 states have internal predecessors, (16449), 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) [2024-11-14 05:45:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 16449 transitions. [2024-11-14 05:45:55,412 INFO L78 Accepts]: Start accepts. Automaton has 4901 states and 16449 transitions. Word has length 32 [2024-11-14 05:45:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:55,412 INFO L471 AbstractCegarLoop]: Abstraction has 4901 states and 16449 transitions. [2024-11-14 05:45:55,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 30 states have internal predecessors, (78), 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) [2024-11-14 05:45:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4901 states and 16449 transitions. [2024-11-14 05:45:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:45:55,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:55,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:45:55,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-14 05:45:55,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-14 05:45:55,619 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:45:55,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -977035365, now seen corresponding path program 10 times [2024-11-14 05:45:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480910391] [2024-11-14 05:45:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:45:57,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480910391] [2024-11-14 05:45:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480910391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:45:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190101733] [2024-11-14 05:45:57,445 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:45:57,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:45:57,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:45:57,447 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:45:57,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-14 05:45:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:57,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 05:45:57,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:45:57,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:45:57,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:45:57,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:45:57,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:45:58,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:46:00,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:46:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:46:00,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:46:10,695 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2024-11-14 05:46:10,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1530 treesize of output 1100 [2024-11-14 05:46:10,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:10,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 692 treesize of output 640 [2024-11-14 05:46:52,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 116 [2024-11-14 05:46:52,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:52,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:52,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:52,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:52,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:52,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 76 [2024-11-14 05:46:53,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 102 [2024-11-14 05:46:53,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2024-11-14 05:46:53,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 211 [2024-11-14 05:46:53,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 185 [2024-11-14 05:46:53,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 90 [2024-11-14 05:46:53,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 117 [2024-11-14 05:46:53,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 181 [2024-11-14 05:46:53,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2024-11-14 05:46:53,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:53,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:54,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:54,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:54,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 155 [2024-11-14 05:46:54,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:54,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:54,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:54,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:54,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:56,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:56,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 75 [2024-11-14 05:46:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:46:58,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190101733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:46:58,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [382515406] [2024-11-14 05:46:58,607 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:46:58,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:46:58,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2024-11-14 05:46:58,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96673194] [2024-11-14 05:46:58,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:46:58,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 05:46:58,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:46:58,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 05:46:58,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=999, Unknown=3, NotChecked=0, Total=1122 [2024-11-14 05:46:58,610 INFO L87 Difference]: Start difference. First operand 4901 states and 16449 transitions. Second operand has 34 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 33 states have internal predecessors, (84), 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) [2024-11-14 05:47:07,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:12,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:15,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:17,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:20,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:22,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:24,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:26,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:28,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:30,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:32,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:34,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:37,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:39,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:41,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:44,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:46,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:51,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:53,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:55,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:56,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:47:58,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:48:01,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:48:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:10,967 INFO L93 Difference]: Finished difference Result 5506 states and 18453 transitions. [2024-11-14 05:48:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:48:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 33 states have internal predecessors, (84), 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 32 [2024-11-14 05:48:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:10,989 INFO L225 Difference]: With dead ends: 5506 [2024-11-14 05:48:10,989 INFO L226 Difference]: Without dead ends: 5423 [2024-11-14 05:48:10,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=306, Invalid=1848, Unknown=8, NotChecked=0, Total=2162 [2024-11-14 05:48:10,993 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 191 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 13 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:10,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 52 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1513 Invalid, 22 Unknown, 0 Unchecked, 57.4s Time] [2024-11-14 05:48:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2024-11-14 05:48:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 4919. [2024-11-14 05:48:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4919 states, 4918 states have (on average 3.3550223668157786) internal successors, (16500), 4918 states have internal predecessors, (16500), 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) [2024-11-14 05:48:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 16500 transitions. [2024-11-14 05:48:11,081 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 16500 transitions. Word has length 32 [2024-11-14 05:48:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:11,081 INFO L471 AbstractCegarLoop]: Abstraction has 4919 states and 16500 transitions. [2024-11-14 05:48:11,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 33 states have internal predecessors, (84), 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) [2024-11-14 05:48:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 16500 transitions. [2024-11-14 05:48:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:48:11,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:11,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:48:11,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2024-11-14 05:48:11,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-14 05:48:11,288 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:48:11,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash -534010755, now seen corresponding path program 11 times [2024-11-14 05:48:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:48:11,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560052060] [2024-11-14 05:48:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:48:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:48:13,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:48:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560052060] [2024-11-14 05:48:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560052060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:48:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491669799] [2024-11-14 05:48:13,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:48:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:48:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:48:13,147 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:48:13,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-14 05:48:13,279 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:48:13,279 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:48:13,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 05:48:13,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:13,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:48:16,239 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:16,354 INFO L349 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2024-11-14 05:48:16,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2024-11-14 05:48:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:48:17,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:48:19,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:19,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2024-11-14 05:48:20,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:20,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 112 [2024-11-14 05:48:20,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:20,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 76 [2024-11-14 05:48:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:48:21,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491669799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:48:21,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [21365740] [2024-11-14 05:48:21,168 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:48:21,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:48:21,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 37 [2024-11-14 05:48:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777757923] [2024-11-14 05:48:21,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:48:21,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 05:48:21,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:48:21,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 05:48:21,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:48:21,170 INFO L87 Difference]: Start difference. First operand 4919 states and 16500 transitions. Second operand has 38 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 37 states have internal predecessors, (90), 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) [2024-11-14 05:48:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:33,187 INFO L93 Difference]: Finished difference Result 6867 states and 23016 transitions. [2024-11-14 05:48:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-14 05:48:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 37 states have internal predecessors, (90), 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 32 [2024-11-14 05:48:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:33,211 INFO L225 Difference]: With dead ends: 6867 [2024-11-14 05:48:33,211 INFO L226 Difference]: Without dead ends: 6735 [2024-11-14 05:48:33,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=575, Invalid=2505, Unknown=0, NotChecked=0, Total=3080 [2024-11-14 05:48:33,214 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 413 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 2002 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:33,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 62 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2002 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-11-14 05:48:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6735 states. [2024-11-14 05:48:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6735 to 4943. [2024-11-14 05:48:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4943 states, 4942 states have (on average 3.3553217320922704) internal successors, (16582), 4942 states have internal predecessors, (16582), 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) [2024-11-14 05:48:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 16582 transitions. [2024-11-14 05:48:33,307 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 16582 transitions. Word has length 32 [2024-11-14 05:48:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:33,308 INFO L471 AbstractCegarLoop]: Abstraction has 4943 states and 16582 transitions. [2024-11-14 05:48:33,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 37 states have internal predecessors, (90), 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) [2024-11-14 05:48:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 16582 transitions. [2024-11-14 05:48:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:48:33,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:33,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:48:33,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-11-14 05:48:33,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:48:33,514 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:48:33,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash 175687143, now seen corresponding path program 12 times [2024-11-14 05:48:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:48:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383885782] [2024-11-14 05:48:33,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:33,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:48:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:48:35,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:48:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383885782] [2024-11-14 05:48:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383885782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:48:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575269328] [2024-11-14 05:48:35,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:48:35,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:48:35,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:48:35,426 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:48:35,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-14 05:48:35,560 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:48:35,560 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:48:35,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:48:35,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:36,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:48:37,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:37,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:48:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:48:38,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:48:39,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:39,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2024-11-14 05:48:40,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:40,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 190 [2024-11-14 05:48:40,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:40,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 134 [2024-11-14 05:48:41,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:41,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 143 [2024-11-14 05:48:41,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:41,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 50 [2024-11-14 05:48:41,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:41,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 227 [2024-11-14 05:48:41,487 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:48:41,560 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:48:41,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 99 [2024-11-14 05:48:41,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:41,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 64 [2024-11-14 05:48:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:48:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575269328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:48:42,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [366211823] [2024-11-14 05:48:42,051 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:48:42,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:48:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 30 [2024-11-14 05:48:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583580796] [2024-11-14 05:48:42,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:48:42,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:48:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:48:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:48:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:48:42,053 INFO L87 Difference]: Start difference. First operand 4943 states and 16582 transitions. Second operand has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 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) [2024-11-14 05:48:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:50,840 INFO L93 Difference]: Finished difference Result 5474 states and 18351 transitions. [2024-11-14 05:48:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:48:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 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 32 [2024-11-14 05:48:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:50,864 INFO L225 Difference]: With dead ends: 5474 [2024-11-14 05:48:50,864 INFO L226 Difference]: Without dead ends: 5393 [2024-11-14 05:48:50,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=271, Invalid=1535, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 05:48:50,867 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 125 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:50,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-14 05:48:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5393 states. [2024-11-14 05:48:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5393 to 4955. [2024-11-14 05:48:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4955 states, 4954 states have (on average 3.353653613241825) internal successors, (16614), 4954 states have internal predecessors, (16614), 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) [2024-11-14 05:48:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 16614 transitions. [2024-11-14 05:48:50,964 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 16614 transitions. Word has length 32 [2024-11-14 05:48:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:50,964 INFO L471 AbstractCegarLoop]: Abstraction has 4955 states and 16614 transitions. [2024-11-14 05:48:50,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 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) [2024-11-14 05:48:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 16614 transitions. [2024-11-14 05:48:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:48:50,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:50,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:48:50,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-11-14 05:48:51,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:48:51,174 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:48:51,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1883243863, now seen corresponding path program 13 times [2024-11-14 05:48:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:48:51,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135608981] [2024-11-14 05:48:51,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:48:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:48:52,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:48:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135608981] [2024-11-14 05:48:52,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135608981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:48:52,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296223504] [2024-11-14 05:48:52,875 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:48:52,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:48:52,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:48:52,877 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:48:52,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-14 05:48:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:53,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 05:48:53,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:53,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:48:53,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:48:53,475 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:48:53,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:48:53,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:48:55,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:48:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:48:55,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:49:02,258 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2024-11-14 05:49:02,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1682 treesize of output 1252 [2024-11-14 05:49:02,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:49:02,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 737 treesize of output 693 [2024-11-14 05:49:11,343 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 05:49:16,489 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 05:49:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:49:53,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296223504] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:49:53,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1546631527] [2024-11-14 05:49:53,045 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:49:53,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:49:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2024-11-14 05:49:53,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875592449] [2024-11-14 05:49:53,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:49:53,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:49:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:49:53,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:49:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=938, Unknown=3, NotChecked=0, Total=1056 [2024-11-14 05:49:53,047 INFO L87 Difference]: Start difference. First operand 4955 states and 16614 transitions. Second operand has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 32 states have internal predecessors, (78), 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) [2024-11-14 05:50:04,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:50:06,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:50:10,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:50:13,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:50:15,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:50:17,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:50:22,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:50:35,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:50:36,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:50:38,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:50:41,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:50:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:50:43,551 INFO L93 Difference]: Finished difference Result 5542 states and 18561 transitions. [2024-11-14 05:50:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:50:43,552 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 32 states have internal predecessors, (78), 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 32 [2024-11-14 05:50:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:50:43,575 INFO L225 Difference]: With dead ends: 5542 [2024-11-14 05:50:43,575 INFO L226 Difference]: Without dead ends: 5475 [2024-11-14 05:50:43,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=334, Invalid=1913, Unknown=9, NotChecked=0, Total=2256 [2024-11-14 05:50:43,577 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 205 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 14 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:50:43,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 58 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1615 Invalid, 10 Unknown, 0 Unchecked, 30.6s Time] [2024-11-14 05:50:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2024-11-14 05:50:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 4967. [2024-11-14 05:50:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4967 states, 4966 states have (on average 3.3532017720499394) internal successors, (16652), 4966 states have internal predecessors, (16652), 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) [2024-11-14 05:50:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4967 states to 4967 states and 16652 transitions. [2024-11-14 05:50:43,711 INFO L78 Accepts]: Start accepts. Automaton has 4967 states and 16652 transitions. Word has length 32 [2024-11-14 05:50:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:50:43,711 INFO L471 AbstractCegarLoop]: Abstraction has 4967 states and 16652 transitions. [2024-11-14 05:50:43,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 32 states have internal predecessors, (78), 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) [2024-11-14 05:50:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4967 states and 16652 transitions. [2024-11-14 05:50:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:50:43,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:50:43,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:50:43,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-14 05:50:43,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:50:43,918 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:50:43,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:50:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1702025535, now seen corresponding path program 14 times [2024-11-14 05:50:43,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:50:43,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389430433] [2024-11-14 05:50:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:50:43,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:50:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:50:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:50:45,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:50:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389430433] [2024-11-14 05:50:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389430433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:50:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128838415] [2024-11-14 05:50:45,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:50:45,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:50:45,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:50:45,860 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:50:45,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-14 05:50:46,000 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:50:46,001 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:50:46,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:50:46,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:50:46,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:50:49,589 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-14 05:50:49,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2024-11-14 05:50:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:50:50,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:50:52,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:50:52,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 250 [2024-11-14 05:50:54,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:50:54,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 162 [2024-11-14 05:50:54,984 INFO L349 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2024-11-14 05:50:54,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 149 [2024-11-14 05:50:55,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:50:55,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 317 [2024-11-14 05:50:58,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:50:58,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:50:58,375 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:50:58,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 1 [2024-11-14 05:50:58,753 INFO L349 Elim1Store]: treesize reduction 29, result has 52.5 percent of original size [2024-11-14 05:50:58,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 99 [2024-11-14 05:50:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:50:59,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128838415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:50:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [919178727] [2024-11-14 05:50:59,898 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:50:59,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:50:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 37 [2024-11-14 05:50:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714643636] [2024-11-14 05:50:59,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:50:59,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 05:50:59,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:50:59,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 05:50:59,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:50:59,900 INFO L87 Difference]: Start difference. First operand 4967 states and 16652 transitions. Second operand has 38 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 37 states have internal predecessors, (90), 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) [2024-11-14 05:51:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:16,845 INFO L93 Difference]: Finished difference Result 6974 states and 23303 transitions. [2024-11-14 05:51:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 05:51:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 37 states have internal predecessors, (90), 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 32 [2024-11-14 05:51:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:16,890 INFO L225 Difference]: With dead ends: 6974 [2024-11-14 05:51:16,890 INFO L226 Difference]: Without dead ends: 6858 [2024-11-14 05:51:16,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=632, Invalid=3149, Unknown=1, NotChecked=0, Total=3782 [2024-11-14 05:51:16,895 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 445 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:16,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 68 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-11-14 05:51:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6858 states. [2024-11-14 05:51:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6858 to 5027. [2024-11-14 05:51:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5027 states, 5026 states have (on average 3.346199761241544) internal successors, (16818), 5026 states have internal predecessors, (16818), 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) [2024-11-14 05:51:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 16818 transitions. [2024-11-14 05:51:17,029 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 16818 transitions. Word has length 32 [2024-11-14 05:51:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:17,030 INFO L471 AbstractCegarLoop]: Abstraction has 5027 states and 16818 transitions. [2024-11-14 05:51:17,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 37 states have internal predecessors, (90), 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) [2024-11-14 05:51:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 16818 transitions. [2024-11-14 05:51:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:51:17,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:17,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:17,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-14 05:51:17,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:51:17,238 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:51:17,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash 988606465, now seen corresponding path program 15 times [2024-11-14 05:51:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410566712] [2024-11-14 05:51:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:19,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:19,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410566712] [2024-11-14 05:51:19,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410566712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:51:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836091863] [2024-11-14 05:51:19,748 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:51:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:51:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:51:19,750 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:51:19,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-14 05:51:19,902 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:51:19,903 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:51:19,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:51:19,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:20,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:51:22,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:22,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:51:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:51:22,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:51:24,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:24,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2024-11-14 05:51:25,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:51:25,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2024-11-14 05:51:26,340 INFO L349 Elim1Store]: treesize reduction 13, result has 77.2 percent of original size [2024-11-14 05:51:26,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 160 [2024-11-14 05:51:27,025 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-14 05:51:27,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 139 [2024-11-14 05:51:27,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:27,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 283 treesize of output 235 [2024-11-14 05:51:29,411 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-11-14 05:51:29,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 283 treesize of output 1 [2024-11-14 05:51:29,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:51:29,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:51:29,481 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:51:29,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 258 treesize of output 1 [2024-11-14 05:51:29,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:51:29,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:51:29,493 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:51:29,709 INFO L349 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2024-11-14 05:51:29,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 71 [2024-11-14 05:51:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:51:30,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836091863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:51:30,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1401919072] [2024-11-14 05:51:30,205 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:51:30,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:51:30,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 33 [2024-11-14 05:51:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409213633] [2024-11-14 05:51:30,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:51:30,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 05:51:30,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:30,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 05:51:30,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 05:51:30,207 INFO L87 Difference]: Start difference. First operand 5027 states and 16818 transitions. Second operand has 34 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 33 states have internal predecessors, (84), 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) [2024-11-14 05:51:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:38,557 INFO L93 Difference]: Finished difference Result 5524 states and 18488 transitions. [2024-11-14 05:51:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:51:38,558 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 33 states have internal predecessors, (84), 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 32 [2024-11-14 05:51:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:38,581 INFO L225 Difference]: With dead ends: 5524 [2024-11-14 05:51:38,581 INFO L226 Difference]: Without dead ends: 5453 [2024-11-14 05:51:38,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=304, Invalid=1858, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 05:51:38,584 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 196 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:38,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 56 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-14 05:51:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5453 states. [2024-11-14 05:51:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5453 to 5015. [2024-11-14 05:51:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5015 states, 5014 states have (on average 3.3466294375747907) internal successors, (16780), 5014 states have internal predecessors, (16780), 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) [2024-11-14 05:51:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 16780 transitions. [2024-11-14 05:51:38,738 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 16780 transitions. Word has length 32 [2024-11-14 05:51:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:38,738 INFO L471 AbstractCegarLoop]: Abstraction has 5015 states and 16780 transitions. [2024-11-14 05:51:38,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 33 states have internal predecessors, (84), 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) [2024-11-14 05:51:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 16780 transitions. [2024-11-14 05:51:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:51:38,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:38,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:38,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-14 05:51:38,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-14 05:51:38,944 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:51:38,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -363736779, now seen corresponding path program 16 times [2024-11-14 05:51:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925665294] [2024-11-14 05:51:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:41,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925665294] [2024-11-14 05:51:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925665294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:51:41,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063388074] [2024-11-14 05:51:41,166 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:51:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:51:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:51:41,168 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:51:41,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-14 05:51:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:41,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:51:41,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:41,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:51:44,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:44,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:51:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:44,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:51:45,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:45,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2024-11-14 05:51:47,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:47,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 144 [2024-11-14 05:51:47,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:51:47,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2024-11-14 05:51:47,792 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-14 05:51:47,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 139 [2024-11-14 05:51:48,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:48,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 174 [2024-11-14 05:51:48,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:48,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 134 [2024-11-14 05:51:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063388074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:51:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2012496172] [2024-11-14 05:51:49,084 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:51:49,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:51:49,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2024-11-14 05:51:49,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189069996] [2024-11-14 05:51:49,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:51:49,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 05:51:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:49,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 05:51:49,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 05:51:49,086 INFO L87 Difference]: Start difference. First operand 5015 states and 16780 transitions. Second operand has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 33 states have internal predecessors, (78), 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) [2024-11-14 05:52:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:52:02,042 INFO L93 Difference]: Finished difference Result 5762 states and 19185 transitions. [2024-11-14 05:52:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-14 05:52:02,043 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 33 states have internal predecessors, (78), 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 32 [2024-11-14 05:52:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:52:02,062 INFO L225 Difference]: With dead ends: 5762 [2024-11-14 05:52:02,063 INFO L226 Difference]: Without dead ends: 5527 [2024-11-14 05:52:02,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=421, Invalid=2549, Unknown=0, NotChecked=0, Total=2970 [2024-11-14 05:52:02,065 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 222 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:52:02,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 65 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-14 05:52:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5527 states. [2024-11-14 05:52:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5527 to 4975. [2024-11-14 05:52:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4975 states, 4974 states have (on average 3.3502211499798955) internal successors, (16664), 4974 states have internal predecessors, (16664), 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) [2024-11-14 05:52:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4975 states to 4975 states and 16664 transitions. [2024-11-14 05:52:02,148 INFO L78 Accepts]: Start accepts. Automaton has 4975 states and 16664 transitions. Word has length 32 [2024-11-14 05:52:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:52:02,148 INFO L471 AbstractCegarLoop]: Abstraction has 4975 states and 16664 transitions. [2024-11-14 05:52:02,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 33 states have internal predecessors, (78), 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) [2024-11-14 05:52:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4975 states and 16664 transitions. [2024-11-14 05:52:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:52:02,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:52:02,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:52:02,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2024-11-14 05:52:02,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-14 05:52:02,354 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:52:02,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:52:02,354 INFO L85 PathProgramCache]: Analyzing trace with hash 19370813, now seen corresponding path program 17 times [2024-11-14 05:52:02,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:52:02,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751425084] [2024-11-14 05:52:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:52:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:52:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:52:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:52:04,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:52:04,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751425084] [2024-11-14 05:52:04,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751425084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:52:04,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163143642] [2024-11-14 05:52:04,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:52:04,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:52:04,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:52:04,392 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:52:04,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-14 05:52:04,528 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:52:04,528 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:52:04,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 05:52:04,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:52:05,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:52:06,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:06,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:52:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:52:07,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:52:08,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:08,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2024-11-14 05:52:09,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:09,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 190 [2024-11-14 05:52:09,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:09,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 130 [2024-11-14 05:52:10,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:10,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2024-11-14 05:52:10,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:10,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 72 [2024-11-14 05:52:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:52:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163143642] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:52:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [157556052] [2024-11-14 05:52:11,021 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:52:11,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:52:11,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-11-14 05:52:11,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162800103] [2024-11-14 05:52:11,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:52:11,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:52:11,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:52:11,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:52:11,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 05:52:11,023 INFO L87 Difference]: Start difference. First operand 4975 states and 16664 transitions. Second operand has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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) [2024-11-14 05:52:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:52:19,242 INFO L93 Difference]: Finished difference Result 5560 states and 18596 transitions. [2024-11-14 05:52:19,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 05:52:19,243 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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 32 [2024-11-14 05:52:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:52:19,264 INFO L225 Difference]: With dead ends: 5560 [2024-11-14 05:52:19,264 INFO L226 Difference]: Without dead ends: 5461 [2024-11-14 05:52:19,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=383, Invalid=1969, Unknown=0, NotChecked=0, Total=2352 [2024-11-14 05:52:19,267 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 237 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:52:19,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 55 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-14 05:52:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2024-11-14 05:52:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 4975. [2024-11-14 05:52:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4975 states, 4974 states have (on average 3.3502211499798955) internal successors, (16664), 4974 states have internal predecessors, (16664), 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) [2024-11-14 05:52:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4975 states to 4975 states and 16664 transitions. [2024-11-14 05:52:19,351 INFO L78 Accepts]: Start accepts. Automaton has 4975 states and 16664 transitions. Word has length 32 [2024-11-14 05:52:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:52:19,351 INFO L471 AbstractCegarLoop]: Abstraction has 4975 states and 16664 transitions. [2024-11-14 05:52:19,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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) [2024-11-14 05:52:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4975 states and 16664 transitions. [2024-11-14 05:52:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:52:19,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:52:19,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:52:19,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2024-11-14 05:52:19,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-14 05:52:19,557 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:52:19,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:52:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1172093321, now seen corresponding path program 18 times [2024-11-14 05:52:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:52:19,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194370500] [2024-11-14 05:52:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:52:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:52:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:52:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:52:21,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:52:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194370500] [2024-11-14 05:52:21,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194370500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:52:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070544558] [2024-11-14 05:52:21,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:52:21,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:52:21,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:52:21,596 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:52:21,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-14 05:52:21,732 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:52:21,732 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:52:21,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:52:21,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:52:22,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:52:24,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:24,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:52:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:52:24,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:52:25,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:25,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2024-11-14 05:52:27,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:27,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 182 [2024-11-14 05:52:29,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:29,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 297 [2024-11-14 05:52:30,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:30,943 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:52:30,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 1 [2024-11-14 05:52:31,041 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-11-14 05:52:31,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 283 treesize of output 1 [2024-11-14 05:52:31,259 INFO L349 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2024-11-14 05:52:31,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 71 [2024-11-14 05:52:31,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,361 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:52:31,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 267 treesize of output 1 [2024-11-14 05:52:31,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,424 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:52:31,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 1 [2024-11-14 05:52:31,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,488 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:52:31,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 1 [2024-11-14 05:52:31,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2024-11-14 05:52:31,583 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:52:31,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:52:31,590 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:52:31,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,648 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:52:31,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 1 [2024-11-14 05:52:31,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,711 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:52:31,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 283 treesize of output 1 [2024-11-14 05:52:31,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 295 [2024-11-14 05:52:31,767 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:52:31,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 178 [2024-11-14 05:52:31,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 110 [2024-11-14 05:52:31,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2024-11-14 05:52:31,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:31,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 50 [2024-11-14 05:52:32,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:32,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 162 [2024-11-14 05:52:32,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:32,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 110 [2024-11-14 05:52:32,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:32,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 143 [2024-11-14 05:52:32,160 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:52:32,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:32,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 211 [2024-11-14 05:52:32,209 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:52:32,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:52:32,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 227 [2024-11-14 05:52:32,259 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:52:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:52:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070544558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:52:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1397238809] [2024-11-14 05:52:33,064 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:52:33,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:52:33,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 32 [2024-11-14 05:52:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455678674] [2024-11-14 05:52:33,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:52:33,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:52:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:52:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:52:33,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 05:52:33,066 INFO L87 Difference]: Start difference. First operand 4975 states and 16664 transitions. Second operand has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 32 states have internal predecessors, (80), 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) [2024-11-14 05:52:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:52:39,440 INFO L93 Difference]: Finished difference Result 5482 states and 18351 transitions. [2024-11-14 05:52:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:52:39,440 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 32 states have internal predecessors, (80), 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 32 [2024-11-14 05:52:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:52:39,463 INFO L225 Difference]: With dead ends: 5482 [2024-11-14 05:52:39,463 INFO L226 Difference]: Without dead ends: 5395 [2024-11-14 05:52:39,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=300, Invalid=1680, Unknown=0, NotChecked=0, Total=1980 [2024-11-14 05:52:39,466 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 161 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:52:39,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 54 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-14 05:52:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2024-11-14 05:52:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 4975. [2024-11-14 05:52:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4975 states, 4974 states have (on average 3.349014877362284) internal successors, (16658), 4974 states have internal predecessors, (16658), 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) [2024-11-14 05:52:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4975 states to 4975 states and 16658 transitions. [2024-11-14 05:52:39,580 INFO L78 Accepts]: Start accepts. Automaton has 4975 states and 16658 transitions. Word has length 32 [2024-11-14 05:52:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:52:39,580 INFO L471 AbstractCegarLoop]: Abstraction has 4975 states and 16658 transitions. [2024-11-14 05:52:39,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 32 states have internal predecessors, (80), 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) [2024-11-14 05:52:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4975 states and 16658 transitions. [2024-11-14 05:52:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:52:39,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:52:39,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:52:39,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2024-11-14 05:52:39,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-11-14 05:52:39,789 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:52:39,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:52:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash 918707517, now seen corresponding path program 19 times [2024-11-14 05:52:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:52:39,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777248018] [2024-11-14 05:52:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:52:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:52:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:52:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:52:41,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:52:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777248018] [2024-11-14 05:52:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777248018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:52:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211397369] [2024-11-14 05:52:41,640 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:52:41,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:52:41,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:52:41,642 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:52:41,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-14 05:52:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:52:41,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 05:52:41,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:52:41,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:52:42,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:52:42,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:52:42,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:52:42,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:52:44,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:52:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:52:44,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:52:51,136 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2024-11-14 05:52:51,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1530 treesize of output 1100 [2024-11-14 05:52:51,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:51,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 694 treesize of output 642 [2024-11-14 05:53:49,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 102 [2024-11-14 05:53:49,741 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-14 05:53:49,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 56 [2024-11-14 05:53:49,968 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:53:49,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:53:49,977 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:53:50,124 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2024-11-14 05:53:50,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 100 [2024-11-14 05:53:50,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:53:50,350 INFO L349 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2024-11-14 05:53:50,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 86 [2024-11-14 05:53:50,378 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:53:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:53:52,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211397369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:53:52,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1993062971] [2024-11-14 05:53:52,802 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:53:52,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:53:52,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2024-11-14 05:53:52,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24901536] [2024-11-14 05:53:52,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:53:52,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:53:52,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:53:52,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:53:52,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=942, Unknown=3, NotChecked=0, Total=1056 [2024-11-14 05:53:52,803 INFO L87 Difference]: Start difference. First operand 4975 states and 16658 transitions. Second operand has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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) [2024-11-14 05:54:01,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:03,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:11,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:13,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:16,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:18,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:20,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:21,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:28,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:54:33,953 INFO L93 Difference]: Finished difference Result 5602 states and 18685 transitions. [2024-11-14 05:54:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:54:33,954 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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 32 [2024-11-14 05:54:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:54:33,977 INFO L225 Difference]: With dead ends: 5602 [2024-11-14 05:54:33,977 INFO L226 Difference]: Without dead ends: 5481 [2024-11-14 05:54:33,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=283, Invalid=1871, Unknown=8, NotChecked=0, Total=2162 [2024-11-14 05:54:33,980 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 187 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 13 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:54:33,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 81 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1927 Invalid, 8 Unknown, 0 Unchecked, 27.0s Time] [2024-11-14 05:54:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2024-11-14 05:54:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 4969. [2024-11-14 05:54:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4969 states, 4968 states have (on average 3.349235104669887) internal successors, (16639), 4968 states have internal predecessors, (16639), 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) [2024-11-14 05:54:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4969 states to 4969 states and 16639 transitions. [2024-11-14 05:54:34,084 INFO L78 Accepts]: Start accepts. Automaton has 4969 states and 16639 transitions. Word has length 32 [2024-11-14 05:54:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:54:34,084 INFO L471 AbstractCegarLoop]: Abstraction has 4969 states and 16639 transitions. [2024-11-14 05:54:34,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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) [2024-11-14 05:54:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4969 states and 16639 transitions. [2024-11-14 05:54:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:54:34,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:54:34,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:54:34,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2024-11-14 05:54:34,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-14 05:54:34,293 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:54:34,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:54:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash -348153213, now seen corresponding path program 20 times [2024-11-14 05:54:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:54:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754702231] [2024-11-14 05:54:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:54:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:54:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:54:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:54:36,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:54:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754702231] [2024-11-14 05:54:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754702231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:54:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062660929] [2024-11-14 05:54:36,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:54:36,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:54:36,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:54:36,636 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:54:36,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-14 05:54:36,808 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:54:36,808 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:54:36,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:54:36,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:54:37,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:54:39,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:54:39,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:54:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:54:39,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:54:40,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:54:40,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2024-11-14 05:54:41,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:54:41,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 313 [2024-11-14 05:54:41,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:54:41,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 196 [2024-11-14 05:54:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:54:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062660929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:54:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [936718887] [2024-11-14 05:54:42,693 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:54:42,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:54:42,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2024-11-14 05:54:42,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42385257] [2024-11-14 05:54:42,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:54:42,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 05:54:42,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:54:42,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 05:54:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-11-14 05:54:42,695 INFO L87 Difference]: Start difference. First operand 4969 states and 16639 transitions. Second operand has 32 states, 32 states have (on average 2.375) internal successors, (76), 31 states have internal predecessors, (76), 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) [2024-11-14 05:54:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:54:51,398 INFO L93 Difference]: Finished difference Result 5522 states and 18463 transitions. [2024-11-14 05:54:51,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 05:54:51,398 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 31 states have internal predecessors, (76), 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 32 [2024-11-14 05:54:51,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:54:51,421 INFO L225 Difference]: With dead ends: 5522 [2024-11-14 05:54:51,421 INFO L226 Difference]: Without dead ends: 5419 [2024-11-14 05:54:51,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=412, Invalid=1940, Unknown=0, NotChecked=0, Total=2352 [2024-11-14 05:54:51,423 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 257 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:54:51,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 60 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-14 05:54:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2024-11-14 05:54:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 4957. [2024-11-14 05:54:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4957 states, 4956 states have (on average 3.3472558514931396) internal successors, (16589), 4956 states have internal predecessors, (16589), 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) [2024-11-14 05:54:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4957 states to 4957 states and 16589 transitions. [2024-11-14 05:54:51,521 INFO L78 Accepts]: Start accepts. Automaton has 4957 states and 16589 transitions. Word has length 32 [2024-11-14 05:54:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:54:51,521 INFO L471 AbstractCegarLoop]: Abstraction has 4957 states and 16589 transitions. [2024-11-14 05:54:51,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 31 states have internal predecessors, (76), 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) [2024-11-14 05:54:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4957 states and 16589 transitions. [2024-11-14 05:54:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:54:51,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:54:51,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:54:51,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2024-11-14 05:54:51,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:54:51,728 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:54:51,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:54:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1796775417, now seen corresponding path program 21 times [2024-11-14 05:54:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:54:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107513911] [2024-11-14 05:54:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:54:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:54:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:54:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:54:53,962 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:54:53,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107513911] [2024-11-14 05:54:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107513911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:54:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288734866] [2024-11-14 05:54:53,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:54:53,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:54:53,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:54:53,965 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:54:53,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-11-14 05:54:54,118 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:54:54,119 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:54:54,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:54:54,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:54:54,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:54:56,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:54:56,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 05:54:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:54:56,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:54:58,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:54:58,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2024-11-14 05:54:59,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:54:59,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 227 [2024-11-14 05:54:59,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:54:59,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 130 [2024-11-14 05:55:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:55:00,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288734866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:55:00,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [933971320] [2024-11-14 05:55:00,139 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:55:00,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:55:00,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 30 [2024-11-14 05:55:00,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270176316] [2024-11-14 05:55:00,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:55:00,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:55:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:55:00,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:55:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:55:00,141 INFO L87 Difference]: Start difference. First operand 4957 states and 16589 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 30 states have internal predecessors, (84), 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) [2024-11-14 05:55:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:55:08,042 INFO L93 Difference]: Finished difference Result 5472 states and 18308 transitions. [2024-11-14 05:55:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:55:08,043 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 30 states have internal predecessors, (84), 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 32 [2024-11-14 05:55:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:55:08,068 INFO L225 Difference]: With dead ends: 5472 [2024-11-14 05:55:08,068 INFO L226 Difference]: Without dead ends: 5389 [2024-11-14 05:55:08,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=259, Invalid=1463, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 05:55:08,071 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 135 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:55:08,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 58 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-14 05:55:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5389 states. [2024-11-14 05:55:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5389 to 4969. [2024-11-14 05:55:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4969 states, 4968 states have (on average 3.3456119162640903) internal successors, (16621), 4968 states have internal predecessors, (16621), 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) [2024-11-14 05:55:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4969 states to 4969 states and 16621 transitions. [2024-11-14 05:55:08,176 INFO L78 Accepts]: Start accepts. Automaton has 4969 states and 16621 transitions. Word has length 32 [2024-11-14 05:55:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:55:08,177 INFO L471 AbstractCegarLoop]: Abstraction has 4969 states and 16621 transitions. [2024-11-14 05:55:08,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 30 states have internal predecessors, (84), 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) [2024-11-14 05:55:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4969 states and 16621 transitions. [2024-11-14 05:55:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:55:08,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:55:08,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:55:08,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2024-11-14 05:55:08,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:55:08,383 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-14 05:55:08,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:55:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1345469371, now seen corresponding path program 22 times [2024-11-14 05:55:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:55:08,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015924676] [2024-11-14 05:55:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:55:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:55:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:55:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:55:11,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:55:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015924676] [2024-11-14 05:55:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015924676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:55:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705872656] [2024-11-14 05:55:11,238 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:55:11,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:55:11,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:55:11,240 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:55:11,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b02cb826-2d2e-4c31-813f-83e0c03f5861/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-14 05:55:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:55:11,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 05:55:11,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:55:11,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:55:11,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:55:12,030 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:55:12,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:55:12,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:55:14,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:55:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:55:14,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:55:24,026 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2024-11-14 05:55:24,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3054 treesize of output 2144 [2024-11-14 05:55:24,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:55:24,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 919 treesize of output 847