./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/bigshot_s.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/bigshot_s.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX --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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:13:37,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:13:37,942 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:13:37,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:13:37,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:13:37,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:13:38,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:13:38,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:13:38,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:13:38,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:13:38,008 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:13:38,009 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:13:38,010 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:13:38,011 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:13:38,012 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:13:38,012 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:13:38,013 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:13:38,013 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:13:38,014 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:13:38,014 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:13:38,015 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:13:38,015 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:13:38,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:13:38,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:13:38,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:13:38,018 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:13:38,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:13:38,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:13:38,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:13:38,020 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:13:38,021 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:13:38,022 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:13:38,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:13:38,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:13:38,022 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:13:38,023 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:13:38,023 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:13:38,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:13:38,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:13:38,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:13:38,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:13:38,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:13:38,025 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:13:38,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:13:38,026 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:13:38,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:13:38,026 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe [2023-11-12 00:13:38,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:13:38,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:13:38,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:13:38,353 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:13:38,355 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:13:38,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread/bigshot_s.i [2023-11-12 00:13:41,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:13:42,041 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:13:42,041 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/sv-benchmarks/c/pthread/bigshot_s.i [2023-11-12 00:13:42,078 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/data/ed27a83ca/8c081836f0734f0b90257be9e257d4c1/FLAG4220e3472 [2023-11-12 00:13:42,095 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/data/ed27a83ca/8c081836f0734f0b90257be9e257d4c1 [2023-11-12 00:13:42,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:13:42,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:13:42,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:13:42,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:13:42,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:13:42,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:13:42" (1/1) ... [2023-11-12 00:13:42,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f056506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:42, skipping insertion in model container [2023-11-12 00:13:42,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:13:42" (1/1) ... [2023-11-12 00:13:42,192 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:13:42,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:13:42,965 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:13:43,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:13:43,139 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:13:43,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43 WrapperNode [2023-11-12 00:13:43,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:13:43,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:13:43,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:13:43,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:13:43,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,226 INFO L138 Inliner]: procedures = 323, calls = 34, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2023-11-12 00:13:43,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:13:43,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:13:43,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:13:43,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:13:43,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:13:43,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:13:43,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:13:43,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:13:43,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (1/1) ... [2023-11-12 00:13:43,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:13:43,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:43,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:13:43,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:13:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:13:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:13:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-12 00:13:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:13:43,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-12 00:13:43,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-12 00:13:43,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-12 00:13:43,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-12 00:13:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:13:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:13:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:13:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:13:43,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:13:43,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:13:43,374 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 00:13:43,523 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:13:43,525 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:13:43,882 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:13:43,891 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:13:43,891 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 00:13:43,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:13:43 BoogieIcfgContainer [2023-11-12 00:13:43,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:13:43,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:13:43,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:13:43,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:13:43,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:13:42" (1/3) ... [2023-11-12 00:13:43,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@805ecdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:13:43, skipping insertion in model container [2023-11-12 00:13:43,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:43" (2/3) ... [2023-11-12 00:13:43,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@805ecdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:13:43, skipping insertion in model container [2023-11-12 00:13:43,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:13:43" (3/3) ... [2023-11-12 00:13:43,913 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2023-11-12 00:13:43,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:13:43,934 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-12 00:13:43,934 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:13:44,046 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-12 00:13:44,094 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:13:44,124 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 120 transitions, 254 flow [2023-11-12 00:13:44,135 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 120 transitions, 254 flow [2023-11-12 00:13:44,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 120 transitions, 254 flow [2023-11-12 00:13:44,192 INFO L124 PetriNetUnfolderBase]: 6/118 cut-off events. [2023-11-12 00:13:44,192 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-12 00:13:44,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 118 events. 6/118 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 162 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-11-12 00:13:44,199 INFO L119 LiptonReduction]: Number of co-enabled transitions 360 [2023-11-12 00:13:50,939 INFO L134 LiptonReduction]: Checked pairs total: 499 [2023-11-12 00:13:50,939 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-11-12 00:13:50,955 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 34 transitions, 82 flow [2023-11-12 00:13:50,977 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 57 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:50,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:13:51,008 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1ce23bf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:13:51,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-12 00:13:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-12 00:13:51,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:51,019 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-12 00:13:51,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:51,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash 474, now seen corresponding path program 1 times [2023-11-12 00:13:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135936194] [2023-11-12 00:13:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:51,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135936194] [2023-11-12 00:13:51,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135936194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:51,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:51,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 00:13:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205761491] [2023-11-12 00:13:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:51,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:13:51,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:51,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:13:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:13:51,205 INFO L87 Difference]: Start difference. First operand has 57 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 56 states have internal predecessors, (91), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:51,270 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2023-11-12 00:13:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:13:51,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2023-11-12 00:13:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:51,282 INFO L225 Difference]: With dead ends: 47 [2023-11-12 00:13:51,282 INFO L226 Difference]: Without dead ends: 47 [2023-11-12 00:13:51,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:13:51,287 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:51,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:13:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-12 00:13:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-12 00:13:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 3.0) internal successors, (75), 46 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 75 transitions. [2023-11-12 00:13:51,325 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 75 transitions. Word has length 1 [2023-11-12 00:13:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:51,326 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 75 transitions. [2023-11-12 00:13:51,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 75 transitions. [2023-11-12 00:13:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:13:51,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:51,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:13:51,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:13:51,327 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:51,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash 466269, now seen corresponding path program 1 times [2023-11-12 00:13:51,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:51,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452879152] [2023-11-12 00:13:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:51,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:51,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452879152] [2023-11-12 00:13:51,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452879152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:51,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:51,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:13:51,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965494520] [2023-11-12 00:13:51,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:51,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:13:51,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:51,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:13:51,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:51,632 INFO L87 Difference]: Start difference. First operand 47 states and 75 transitions. 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) [2023-11-12 00:13:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:51,690 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2023-11-12 00:13:51,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:13:51,691 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 [2023-11-12 00:13:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:51,692 INFO L225 Difference]: With dead ends: 45 [2023-11-12 00:13:51,692 INFO L226 Difference]: Without dead ends: 45 [2023-11-12 00:13:51,693 INFO L412 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 [2023-11-12 00:13:51,694 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:51,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-12 00:13:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-12 00:13:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 24 states have (on average 3.0) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2023-11-12 00:13:51,714 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 3 [2023-11-12 00:13:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:51,714 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2023-11-12 00:13:51,715 INFO L496 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) [2023-11-12 00:13:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2023-11-12 00:13:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:13:51,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:51,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:13:51,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:13:51,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:51,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash 466270, now seen corresponding path program 1 times [2023-11-12 00:13:51,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159886951] [2023-11-12 00:13:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:51,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:51,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159886951] [2023-11-12 00:13:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159886951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:51,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:51,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:13:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790441428] [2023-11-12 00:13:51,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:51,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:13:51,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:13:51,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:51,940 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. 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) [2023-11-12 00:13:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:52,023 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2023-11-12 00:13:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:13:52,024 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 [2023-11-12 00:13:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:52,026 INFO L225 Difference]: With dead ends: 44 [2023-11-12 00:13:52,026 INFO L226 Difference]: Without dead ends: 44 [2023-11-12 00:13:52,028 INFO L412 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 [2023-11-12 00:13:52,031 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:52,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-12 00:13:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-12 00:13:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 43 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2023-11-12 00:13:52,052 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 3 [2023-11-12 00:13:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:52,052 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2023-11-12 00:13:52,053 INFO L496 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) [2023-11-12 00:13:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2023-11-12 00:13:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:13:52,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:52,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:13:52,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:13:52,054 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:52,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash 14455454, now seen corresponding path program 1 times [2023-11-12 00:13:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:52,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843083818] [2023-11-12 00:13:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:52,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:52,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:52,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843083818] [2023-11-12 00:13:52,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843083818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:52,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:52,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:13:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887397383] [2023-11-12 00:13:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:52,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:13:52,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:13:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:13:52,312 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) 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) [2023-11-12 00:13:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:52,403 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2023-11-12 00:13:52,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:13:52,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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 [2023-11-12 00:13:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:52,405 INFO L225 Difference]: With dead ends: 43 [2023-11-12 00:13:52,405 INFO L226 Difference]: Without dead ends: 43 [2023-11-12 00:13:52,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:13:52,406 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:52,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-12 00:13:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-12 00:13:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 3.0) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2023-11-12 00:13:52,412 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 4 [2023-11-12 00:13:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:52,412 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 69 transitions. [2023-11-12 00:13:52,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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) [2023-11-12 00:13:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2023-11-12 00:13:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:13:52,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:52,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:13:52,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:13:52,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:52,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1006105373, now seen corresponding path program 1 times [2023-11-12 00:13:52,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745059714] [2023-11-12 00:13:52,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:52,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:52,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745059714] [2023-11-12 00:13:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745059714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:52,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:52,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:13:52,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185007330] [2023-11-12 00:13:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:52,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:13:52,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:52,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:13:52,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:13:52,588 INFO L87 Difference]: Start difference. First operand 43 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:52,639 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2023-11-12 00:13:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:13:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:13:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:52,640 INFO L225 Difference]: With dead ends: 27 [2023-11-12 00:13:52,640 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:13:52,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:13:52,642 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:52,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:13:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:13:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 00:13:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2023-11-12 00:13:52,646 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 6 [2023-11-12 00:13:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:52,647 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2023-11-12 00:13:52,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2023-11-12 00:13:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:13:52,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:52,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:52,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:13:52,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:52,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1691259348, now seen corresponding path program 1 times [2023-11-12 00:13:52,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:52,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606099267] [2023-11-12 00:13:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:52,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:53,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:53,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606099267] [2023-11-12 00:13:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606099267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:53,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:13:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404422787] [2023-11-12 00:13:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:53,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:13:53,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:53,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:13:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:13:53,095 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:53,299 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2023-11-12 00:13:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:13:53,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2023-11-12 00:13:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:53,301 INFO L225 Difference]: With dead ends: 35 [2023-11-12 00:13:53,302 INFO L226 Difference]: Without dead ends: 35 [2023-11-12 00:13:53,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:13:53,303 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:53,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-12 00:13:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2023-11-12 00:13:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 28 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) [2023-11-12 00:13:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2023-11-12 00:13:53,308 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 48 transitions. Word has length 9 [2023-11-12 00:13:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:53,309 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 48 transitions. [2023-11-12 00:13:53,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 48 transitions. [2023-11-12 00:13:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:13:53,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:53,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:53,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:13:53,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:53,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1691259389, now seen corresponding path program 1 times [2023-11-12 00:13:53,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:53,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664280947] [2023-11-12 00:13:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:53,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664280947] [2023-11-12 00:13:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664280947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:13:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760791198] [2023-11-12 00:13:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:53,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:13:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:13:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:13:53,588 INFO L87 Difference]: Start difference. First operand 29 states and 48 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:53,664 INFO L93 Difference]: Finished difference Result 27 states and 43 transitions. [2023-11-12 00:13:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:13:53,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2023-11-12 00:13:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:53,667 INFO L225 Difference]: With dead ends: 27 [2023-11-12 00:13:53,667 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:13:53,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:13:53,669 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:53,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:13:53,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 00:13:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 2.15) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 43 transitions. [2023-11-12 00:13:53,682 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 43 transitions. Word has length 9 [2023-11-12 00:13:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:53,683 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 43 transitions. [2023-11-12 00:13:53,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2023-11-12 00:13:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:13:53,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:53,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:53,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:13:53,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:53,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1691259273, now seen corresponding path program 1 times [2023-11-12 00:13:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:53,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891830512] [2023-11-12 00:13:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:53,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:53,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:53,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891830512] [2023-11-12 00:13:53,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891830512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:53,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:53,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:13:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96813069] [2023-11-12 00:13:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:53,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:13:53,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:53,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:13:53,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:13:53,809 INFO L87 Difference]: Start difference. First operand 27 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:53,881 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2023-11-12 00:13:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:13:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2023-11-12 00:13:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:53,882 INFO L225 Difference]: With dead ends: 28 [2023-11-12 00:13:53,883 INFO L226 Difference]: Without dead ends: 28 [2023-11-12 00:13:53,883 INFO L412 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 [2023-11-12 00:13:53,885 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:53,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-12 00:13:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-11-12 00:13:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 2.0) internal successors, (40), 25 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) [2023-11-12 00:13:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2023-11-12 00:13:53,890 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 9 [2023-11-12 00:13:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:53,891 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2023-11-12 00:13:53,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2023-11-12 00:13:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:13:53,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:53,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:53,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:13:53,893 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:53,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1691259272, now seen corresponding path program 1 times [2023-11-12 00:13:53,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:53,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817890881] [2023-11-12 00:13:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:53,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817890881] [2023-11-12 00:13:53,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817890881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:53,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:53,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:13:53,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902002427] [2023-11-12 00:13:53,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:53,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:13:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:53,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:13:53,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:13:53,967 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:54,015 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2023-11-12 00:13:54,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:13:54,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2023-11-12 00:13:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:54,016 INFO L225 Difference]: With dead ends: 23 [2023-11-12 00:13:54,016 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 00:13:54,016 INFO L412 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 [2023-11-12 00:13:54,017 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:54,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:13:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 00:13:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 00:13:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2023-11-12 00:13:54,021 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 9 [2023-11-12 00:13:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:54,021 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2023-11-12 00:13:54,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2023-11-12 00:13:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:13:54,022 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:54,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:54,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:13:54,023 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:54,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash -889428443, now seen corresponding path program 1 times [2023-11-12 00:13:54,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:54,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949867521] [2023-11-12 00:13:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:54,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949867521] [2023-11-12 00:13:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949867521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131988572] [2023-11-12 00:13:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:54,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:54,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:54,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:54,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:13:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:54,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-12 00:13:54,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:54,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:54,900 INFO L322 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2023-11-12 00:13:54,901 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 23 [2023-11-12 00:13:54,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-11-12 00:13:54,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:54,932 INFO L351 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 14 treesize of output 9 [2023-11-12 00:13:54,952 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:13:54,952 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 00:13:54,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:54,993 INFO L351 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 14 treesize of output 9 [2023-11-12 00:13:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:55,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:13:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131988572] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:13:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1179394812] [2023-11-12 00:13:55,256 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:13:55,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:13:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-11-12 00:13:55,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113277564] [2023-11-12 00:13:55,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:13:55,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:13:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:55,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:13:55,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-11-12 00:13:55,262 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:55,681 INFO L93 Difference]: Finished difference Result 33 states and 57 transitions. [2023-11-12 00:13:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:13:55,682 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-12 00:13:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:55,682 INFO L225 Difference]: With dead ends: 33 [2023-11-12 00:13:55,682 INFO L226 Difference]: Without dead ends: 33 [2023-11-12 00:13:55,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2023-11-12 00:13:55,683 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:55,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 0 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-12 00:13:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-11-12 00:13:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 2.2) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2023-11-12 00:13:55,687 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 10 [2023-11-12 00:13:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:55,687 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 55 transitions. [2023-11-12 00:13:55,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 55 transitions. [2023-11-12 00:13:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:13:55,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:55,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:55,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:13:55,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:13:55,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:55,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash -889428368, now seen corresponding path program 1 times [2023-11-12 00:13:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:55,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594082537] [2023-11-12 00:13:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:56,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:56,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594082537] [2023-11-12 00:13:56,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594082537] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:56,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604431314] [2023-11-12 00:13:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:56,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:56,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:56,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:56,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:13:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:56,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-12 00:13:56,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:56,213 INFO L351 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 [2023-11-12 00:13:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:56,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:13:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:56,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604431314] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:13:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [407121067] [2023-11-12 00:13:56,368 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:13:56,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:13:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-11-12 00:13:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120428677] [2023-11-12 00:13:56,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:13:56,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:13:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:56,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:13:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:13:56,374 INFO L87 Difference]: Start difference. First operand 29 states and 55 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 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) [2023-11-12 00:13:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:56,553 INFO L93 Difference]: Finished difference Result 29 states and 49 transitions. [2023-11-12 00:13:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:13:56,554 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 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 10 [2023-11-12 00:13:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:56,555 INFO L225 Difference]: With dead ends: 29 [2023-11-12 00:13:56,555 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:13:56,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-11-12 00:13:56,556 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:56,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:13:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-12 00:13:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.96) internal successors, (49), 28 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) [2023-11-12 00:13:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 49 transitions. [2023-11-12 00:13:56,559 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 49 transitions. Word has length 10 [2023-11-12 00:13:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:56,559 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 49 transitions. [2023-11-12 00:13:56,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 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) [2023-11-12 00:13:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 49 transitions. [2023-11-12 00:13:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:13:56,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:56,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:56,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:13:56,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:13:56,767 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:56,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1802996958, now seen corresponding path program 1 times [2023-11-12 00:13:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:56,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573276215] [2023-11-12 00:13:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:56,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573276215] [2023-11-12 00:13:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573276215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:56,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:56,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:13:56,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224138096] [2023-11-12 00:13:56,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:56,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:13:56,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:56,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:13:56,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:56,809 INFO L87 Difference]: Start difference. First operand 29 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2023-11-12 00:13:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:56,841 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. [2023-11-12 00:13:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:13:56,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 [2023-11-12 00:13:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:56,842 INFO L225 Difference]: With dead ends: 29 [2023-11-12 00:13:56,842 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:13:56,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:56,844 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:56,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:13:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:13:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-12 00:13:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.88) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2023-11-12 00:13:56,858 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 11 [2023-11-12 00:13:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:56,858 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 47 transitions. [2023-11-12 00:13:56,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2023-11-12 00:13:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 47 transitions. [2023-11-12 00:13:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:13:56,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:56,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:56,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:13:56,860 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:56,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:56,861 INFO L85 PathProgramCache]: Analyzing trace with hash -43427413, now seen corresponding path program 1 times [2023-11-12 00:13:56,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:56,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492247146] [2023-11-12 00:13:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:57,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492247146] [2023-11-12 00:13:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492247146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:57,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:57,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:13:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739905102] [2023-11-12 00:13:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:57,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:13:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:13:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:13:57,447 INFO L87 Difference]: Start difference. First operand 29 states and 47 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2023-11-12 00:13:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:57,622 INFO L93 Difference]: Finished difference Result 29 states and 45 transitions. [2023-11-12 00:13:57,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:13:57,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 [2023-11-12 00:13:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:57,623 INFO L225 Difference]: With dead ends: 29 [2023-11-12 00:13:57,623 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:13:57,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:13:57,624 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:57,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:13:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-12 00:13:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.8) internal successors, (45), 28 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) [2023-11-12 00:13:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2023-11-12 00:13:57,627 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 12 [2023-11-12 00:13:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:57,627 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2023-11-12 00:13:57,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2023-11-12 00:13:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2023-11-12 00:13:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:13:57,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:57,628 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:57,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 00:13:57,629 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:13:57,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:57,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1305729940, now seen corresponding path program 2 times [2023-11-12 00:13:57,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:57,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275932120] [2023-11-12 00:13:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:58,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:58,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275932120] [2023-11-12 00:13:58,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275932120] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:58,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990027866] [2023-11-12 00:13:58,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:13:58,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:58,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:58,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:58,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:13:58,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 00:13:58,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:13:58,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-12 00:13:58,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:58,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:58,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:58,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-11-12 00:13:58,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:58,565 INFO L322 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2023-11-12 00:13:58,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 28 [2023-11-12 00:13:58,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:58,684 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:13:58,685 INFO L351 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 1 case distinctions, treesize of input 16 treesize of output 14 [2023-11-12 00:13:58,690 INFO L351 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 14 treesize of output 9 [2023-11-12 00:13:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:58,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:13:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990027866] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:13:59,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1702985255] [2023-11-12 00:13:59,256 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:13:59,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:13:59,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2023-11-12 00:13:59,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250882305] [2023-11-12 00:13:59,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:13:59,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-12 00:13:59,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:59,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 00:13:59,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2023-11-12 00:13:59,260 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:00,290 INFO L93 Difference]: Finished difference Result 43 states and 76 transitions. [2023-11-12 00:14:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:14:00,291 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 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 [2023-11-12 00:14:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:00,291 INFO L225 Difference]: With dead ends: 43 [2023-11-12 00:14:00,292 INFO L226 Difference]: Without dead ends: 43 [2023-11-12 00:14:00,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=268, Invalid=922, Unknown=0, NotChecked=0, Total=1190 [2023-11-12 00:14:00,293 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:14:00,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:14:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-12 00:14:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2023-11-12 00:14:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 2.212121212121212) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 73 transitions. [2023-11-12 00:14:00,297 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 73 transitions. Word has length 13 [2023-11-12 00:14:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:00,298 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 73 transitions. [2023-11-12 00:14:00,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 73 transitions. [2023-11-12 00:14:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:14:00,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:00,299 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:14:00,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:14:00,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-12 00:14:00,500 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:14:00,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1305729865, now seen corresponding path program 2 times [2023-11-12 00:14:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877593476] [2023-11-12 00:14:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:00,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:00,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877593476] [2023-11-12 00:14:00,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877593476] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:00,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913849237] [2023-11-12 00:14:00,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:14:00,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:00,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:00,745 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:00,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:14:00,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-12 00:14:00,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:14:00,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-12 00:14:00,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:00,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:00,914 INFO L322 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2023-11-12 00:14:00,914 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 28 [2023-11-12 00:14:00,923 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-11-12 00:14:01,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:01,012 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:14:01,013 INFO L351 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 1 case distinctions, treesize of input 16 treesize of output 14 [2023-11-12 00:14:01,020 INFO L351 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 14 treesize of output 9 [2023-11-12 00:14:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:14:01,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:14:01,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913849237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:14:01,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:14:01,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2023-11-12 00:14:01,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030597273] [2023-11-12 00:14:01,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:14:01,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:14:01,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:01,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:14:01,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:14:01,177 INFO L87 Difference]: Start difference. First operand 37 states and 73 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:01,304 INFO L93 Difference]: Finished difference Result 35 states and 62 transitions. [2023-11-12 00:14:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:14:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-12 00:14:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:01,306 INFO L225 Difference]: With dead ends: 35 [2023-11-12 00:14:01,306 INFO L226 Difference]: Without dead ends: 35 [2023-11-12 00:14:01,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-12 00:14:01,307 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:14:01,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:14:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-12 00:14:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-12 00:14:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.9375) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2023-11-12 00:14:01,309 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 13 [2023-11-12 00:14:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:01,310 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2023-11-12 00:14:01,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2023-11-12 00:14:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:14:01,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:01,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:14:01,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:14:01,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-12 00:14:01,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:14:01,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1307036910, now seen corresponding path program 1 times [2023-11-12 00:14:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:01,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11428763] [2023-11-12 00:14:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:01,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:01,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11428763] [2023-11-12 00:14:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11428763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346731001] [2023-11-12 00:14:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:01,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:01,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:01,968 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:01,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:14:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:02,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-12 00:14:02,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:02,124 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-12 00:14:02,125 INFO L351 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 20 treesize of output 22 [2023-11-12 00:14:02,130 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:14:02,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:02,285 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:14:02,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2023-11-12 00:14:02,347 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:14:02,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 28 [2023-11-12 00:14:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:02,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:14:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:02,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346731001] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:14:02,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723276916] [2023-11-12 00:14:02,525 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:14:02,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:14:02,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 17 [2023-11-12 00:14:02,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172929829] [2023-11-12 00:14:02,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:14:02,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 00:14:02,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:02,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 00:14:02,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-11-12 00:14:02,527 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:02,902 INFO L93 Difference]: Finished difference Result 39 states and 63 transitions. [2023-11-12 00:14:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:14:02,903 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-12 00:14:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:02,903 INFO L225 Difference]: With dead ends: 39 [2023-11-12 00:14:02,903 INFO L226 Difference]: Without dead ends: 39 [2023-11-12 00:14:02,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2023-11-12 00:14:02,904 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:14:02,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:14:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-12 00:14:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2023-11-12 00:14:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.8) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2023-11-12 00:14:02,907 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 13 [2023-11-12 00:14:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:02,907 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2023-11-12 00:14:02,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2023-11-12 00:14:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:14:02,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:02,908 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:14:02,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:14:03,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-12 00:14:03,115 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:14:03,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1824225641, now seen corresponding path program 1 times [2023-11-12 00:14:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:03,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610092700] [2023-11-12 00:14:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:03,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:03,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610092700] [2023-11-12 00:14:03,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610092700] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:03,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556796739] [2023-11-12 00:14:03,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:03,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:03,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:03,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:03,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:14:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:03,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-12 00:14:03,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:03,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:03,798 INFO L322 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2023-11-12 00:14:03,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 23 [2023-11-12 00:14:03,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:14:03,830 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:14:03,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 15 [2023-11-12 00:14:03,848 INFO L322 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2023-11-12 00:14:03,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 1 [2023-11-12 00:14:03,907 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:14:03,907 INFO L351 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 [2023-11-12 00:14:03,949 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:04,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:04,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:04,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:14:04,138 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_302) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-11-12 00:14:04,145 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_302) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-11-12 00:14:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-12 00:14:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556796739] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:14:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [809059912] [2023-11-12 00:14:04,304 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:14:04,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:14:04,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-11-12 00:14:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335908266] [2023-11-12 00:14:04,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:14:04,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 00:14:04,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 00:14:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=263, Unknown=3, NotChecked=66, Total=380 [2023-11-12 00:14:04,308 INFO L87 Difference]: Start difference. First operand 38 states and 63 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) [2023-11-12 00:14:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:04,681 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2023-11-12 00:14:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:14:04,682 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 14 [2023-11-12 00:14:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:04,683 INFO L225 Difference]: With dead ends: 38 [2023-11-12 00:14:04,683 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 00:14:04,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=365, Unknown=3, NotChecked=82, Total=552 [2023-11-12 00:14:04,684 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:14:04,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 159 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2023-11-12 00:14:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 00:14:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-12 00:14:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 37 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2023-11-12 00:14:04,686 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 61 transitions. Word has length 14 [2023-11-12 00:14:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:04,686 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-11-12 00:14:04,686 INFO L496 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) [2023-11-12 00:14:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 61 transitions. [2023-11-12 00:14:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:14:04,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:04,687 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:14:04,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:14:04,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-12 00:14:04,895 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:14:04,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:04,896 INFO L85 PathProgramCache]: Analyzing trace with hash -677207490, now seen corresponding path program 2 times [2023-11-12 00:14:04,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:04,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29139256] [2023-11-12 00:14:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:04,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:05,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:05,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29139256] [2023-11-12 00:14:05,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29139256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973678962] [2023-11-12 00:14:05,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:14:05,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:05,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:05,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:05,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:14:05,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 00:14:05,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:14:05,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-12 00:14:05,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:05,671 INFO L322 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2023-11-12 00:14:05,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 32 [2023-11-12 00:14:05,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:14:05,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:05,809 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:14:05,810 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-11-12 00:14:05,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:05,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:05,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:06,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:06,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:14:06,171 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_349) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-11-12 00:14:06,178 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_349) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-11-12 00:14:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-12 00:14:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973678962] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:14:06,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [868246756] [2023-11-12 00:14:06,374 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:14:06,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:14:06,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-11-12 00:14:06,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653014518] [2023-11-12 00:14:06,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:14:06,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-12 00:14:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:06,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 00:14:06,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=328, Unknown=6, NotChecked=74, Total=462 [2023-11-12 00:14:06,378 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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) [2023-11-12 00:14:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:06,968 INFO L93 Difference]: Finished difference Result 38 states and 59 transitions. [2023-11-12 00:14:06,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:14:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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 15 [2023-11-12 00:14:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:06,970 INFO L225 Difference]: With dead ends: 38 [2023-11-12 00:14:06,971 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 00:14:06,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=484, Unknown=6, NotChecked=94, Total=702 [2023-11-12 00:14:06,972 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:14:06,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 224 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2023-11-12 00:14:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 00:14:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-12 00:14:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2023-11-12 00:14:06,975 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 15 [2023-11-12 00:14:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:06,975 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 59 transitions. [2023-11-12 00:14:06,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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) [2023-11-12 00:14:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2023-11-12 00:14:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:14:06,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:06,977 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:14:06,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-12 00:14:07,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-12 00:14:07,183 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:14:07,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash 520616823, now seen corresponding path program 3 times [2023-11-12 00:14:07,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:07,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160612106] [2023-11-12 00:14:07,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:07,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:08,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160612106] [2023-11-12 00:14:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160612106] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511891082] [2023-11-12 00:14:08,016 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 00:14:08,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:08,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:08,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-12 00:14:08,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 00:14:08,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:14:08,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-12 00:14:08,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:08,252 INFO L322 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2023-11-12 00:14:08,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 32 [2023-11-12 00:14:08,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:14:08,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:08,396 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:14:08,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-11-12 00:14:08,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:08,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:08,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:08,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:08,707 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:08,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:14:08,910 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_401) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-11-12 00:14:08,916 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_401) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-11-12 00:14:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-12 00:14:09,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511891082] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:14:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1980075302] [2023-11-12 00:14:09,144 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:14:09,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:14:09,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-11-12 00:14:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021953714] [2023-11-12 00:14:09,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:14:09,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-12 00:14:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 00:14:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=444, Unknown=15, NotChecked=86, Total=600 [2023-11-12 00:14:09,146 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:09,944 INFO L93 Difference]: Finished difference Result 35 states and 54 transitions. [2023-11-12 00:14:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:14:09,946 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-12 00:14:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:09,946 INFO L225 Difference]: With dead ends: 35 [2023-11-12 00:14:09,946 INFO L226 Difference]: Without dead ends: 35 [2023-11-12 00:14:09,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=671, Unknown=16, NotChecked=110, Total=930 [2023-11-12 00:14:09,948 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:14:09,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 315 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2023-11-12 00:14:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-12 00:14:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-12 00:14:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.6875) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 54 transitions. [2023-11-12 00:14:09,951 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 54 transitions. Word has length 16 [2023-11-12 00:14:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:09,951 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 54 transitions. [2023-11-12 00:14:09,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 54 transitions. [2023-11-12 00:14:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:14:09,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:09,952 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:14:09,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-12 00:14:10,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:10,159 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:14:10,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1000228180, now seen corresponding path program 3 times [2023-11-12 00:14:10,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713093458] [2023-11-12 00:14:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:11,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713093458] [2023-11-12 00:14:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713093458] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780405473] [2023-11-12 00:14:11,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 00:14:11,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:11,177 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:11,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-12 00:14:11,362 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 00:14:11,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:14:11,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-12 00:14:11,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:11,426 INFO L322 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2023-11-12 00:14:11,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 32 [2023-11-12 00:14:11,437 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:14:11,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:11,600 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:14:11,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-11-12 00:14:11,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:11,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:11,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:11,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:11,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:11,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:11,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:12,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:12,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:14:12,120 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_464) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)) 0)) is different from false [2023-11-12 00:14:12,183 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_464) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2023-11-12 00:14:12,242 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_464) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-11-12 00:14:12,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~v~0.base v_ArrVal_464) 3) 7) 0)) is different from false [2023-11-12 00:14:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-11-12 00:14:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780405473] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:14:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472591082] [2023-11-12 00:14:12,565 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:14:12,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:14:12,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2023-11-12 00:14:12,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018041102] [2023-11-12 00:14:12,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:14:12,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-12 00:14:12,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:12,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-12 00:14:12,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=894, Unknown=24, NotChecked=252, Total=1260 [2023-11-12 00:14:12,572 INFO L87 Difference]: Start difference. First operand 35 states and 54 transitions. Second operand has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 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) [2023-11-12 00:14:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:13,894 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2023-11-12 00:14:13,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:14:13,895 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 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 17 [2023-11-12 00:14:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:13,895 INFO L225 Difference]: With dead ends: 31 [2023-11-12 00:14:13,896 INFO L226 Difference]: Without dead ends: 31 [2023-11-12 00:14:13,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=218, Invalid=1414, Unknown=24, NotChecked=324, Total=1980 [2023-11-12 00:14:13,898 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:14:13,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 566 Invalid, 0 Unknown, 115 Unchecked, 0.6s Time] [2023-11-12 00:14:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-12 00:14:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-12 00:14:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:14:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2023-11-12 00:14:13,901 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 17 [2023-11-12 00:14:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:13,901 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2023-11-12 00:14:13,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 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) [2023-11-12 00:14:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2023-11-12 00:14:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:14:13,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:13,903 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:14:13,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-12 00:14:14,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:14,109 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-12 00:14:14,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1001535150, now seen corresponding path program 2 times [2023-11-12 00:14:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:14,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268191101] [2023-11-12 00:14:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:14,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268191101] [2023-11-12 00:14:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268191101] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925977345] [2023-11-12 00:14:14,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:14:14,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:14,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:14,747 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:14,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa7ca1f-e862-4402-9ce4-779723edc726/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-12 00:14:14,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-12 00:14:14,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:14:14,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-12 00:14:14,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:14,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:14,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:14,960 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-12 00:14:14,960 INFO L351 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 20 treesize of output 22 [2023-11-12 00:14:15,027 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-12 00:14:15,126 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-12 00:14:15,126 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2023-11-12 00:14:15,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:15,199 INFO L322 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2023-11-12 00:14:15,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2023-11-12 00:14:15,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:15,297 INFO L322 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2023-11-12 00:14:15,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2023-11-12 00:14:15,478 INFO L322 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2023-11-12 00:14:15,479 INFO L351 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 62 [2023-11-12 00:14:15,773 INFO L322 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2023-11-12 00:14:15,773 INFO L351 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 76 [2023-11-12 00:14:16,139 INFO L322 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-11-12 00:14:16,139 INFO L351 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 99 [2023-11-12 00:14:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:14:16,508 INFO L327 TraceCheckSpWp]: Computing backward predicates...