./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/unroll-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/unroll-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7071c3ff0bb3d9f81f254bc51d27ce3551a85cc081b1b878560a7d4c8f67639e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 13:53:53,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:53:53,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:53:53,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:53:53,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:53:53,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:53:53,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:53:53,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:53:53,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:53:53,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:53:53,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:53:53,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:53:53,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:53:53,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:53:53,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:53:53,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:53:53,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:53:53,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:53:53,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:53:53,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:53:53,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:53:53,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:53:53,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:53:53,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:53:53,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:53:53,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:53:53,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:53:53,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:53:53,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:53:53,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:53:53,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:53:53,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:53:53,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:53:53,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:53:53,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:53:53,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:53:53,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:53:53,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:53:53,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:53:53,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:53:53,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:53:53,113 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 13:53:53,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:53:53,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:53:53,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:53:53,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:53:53,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:53:53,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:53:53,133 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:53:53,133 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:53:53,133 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:53:53,134 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:53:53,134 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:53:53,134 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:53:53,134 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:53:53,134 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:53:53,134 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:53:53,135 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:53:53,135 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:53:53,135 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:53:53,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:53:53,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:53:53,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:53:53,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:53:53,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:53:53,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:53:53,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:53:53,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:53:53,137 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:53:53,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:53:53,137 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:53:53,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:53:53,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:53:53,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:53:53,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:53:53,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:53:53,138 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:53:53,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:53:53,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:53:53,139 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:53:53,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:53:53,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:53:53,139 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:53:53,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/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_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7071c3ff0bb3d9f81f254bc51d27ce3551a85cc081b1b878560a7d4c8f67639e [2022-12-14 13:53:53,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:53:53,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:53:53,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:53:53,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:53:53,362 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:53:53,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/unroll-4.wvr.c [2022-12-14 13:53:55,902 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:53:56,058 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:53:56,059 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/sv-benchmarks/c/weaver/unroll-4.wvr.c [2022-12-14 13:53:56,064 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/data/eb160d5cf/ba2e232acc2b438da07b465608d01441/FLAG8cbd18c89 [2022-12-14 13:53:56,464 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/data/eb160d5cf/ba2e232acc2b438da07b465608d01441 [2022-12-14 13:53:56,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:53:56,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:53:56,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:53:56,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:53:56,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:53:56,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6285f91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56, skipping insertion in model container [2022-12-14 13:53:56,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:53:56,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:53:56,636 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/sv-benchmarks/c/weaver/unroll-4.wvr.c[2572,2585] [2022-12-14 13:53:56,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:53:56,652 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:53:56,671 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/sv-benchmarks/c/weaver/unroll-4.wvr.c[2572,2585] [2022-12-14 13:53:56,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:53:56,689 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:53:56,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56 WrapperNode [2022-12-14 13:53:56,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:53:56,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:53:56,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:53:56,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:53:56,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,728 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 154 [2022-12-14 13:53:56,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:53:56,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:53:56,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:53:56,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:53:56,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,752 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:53:56,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:53:56,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:53:56,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:53:56,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (1/1) ... [2022-12-14 13:53:56,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:53:56,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:53:56,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:53:56,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:53:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:53:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 13:53:56,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 13:53:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 13:53:56,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 13:53:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:53:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 13:53:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 13:53:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 13:53:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:53:56,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:53:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 13:53:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 13:53:56,837 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 13:53:56,929 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:53:56,931 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:53:57,170 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:53:57,177 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:53:57,177 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 13:53:57,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:53:57 BoogieIcfgContainer [2022-12-14 13:53:57,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:53:57,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:53:57,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:53:57,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:53:57,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:53:56" (1/3) ... [2022-12-14 13:53:57,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57014d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:53:57, skipping insertion in model container [2022-12-14 13:53:57,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:53:56" (2/3) ... [2022-12-14 13:53:57,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57014d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:53:57, skipping insertion in model container [2022-12-14 13:53:57,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:53:57" (3/3) ... [2022-12-14 13:53:57,185 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2022-12-14 13:53:57,192 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 13:53:57,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:53:57,199 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 13:53:57,200 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 13:53:57,259 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 13:53:57,283 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 13:53:57,293 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 199 transitions, 414 flow [2022-12-14 13:53:57,295 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 199 transitions, 414 flow [2022-12-14 13:53:57,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 199 transitions, 414 flow [2022-12-14 13:53:57,352 INFO L130 PetriNetUnfolder]: 16/197 cut-off events. [2022-12-14 13:53:57,352 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 13:53:57,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 197 events. 16/197 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 169 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2022-12-14 13:53:57,358 INFO L119 LiptonReduction]: Number of co-enabled transitions 3584 [2022-12-14 13:54:01,415 INFO L134 LiptonReduction]: Checked pairs total: 3505 [2022-12-14 13:54:01,415 INFO L136 LiptonReduction]: Total number of compositions: 234 [2022-12-14 13:54:01,421 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 20 transitions, 56 flow [2022-12-14 13:54:01,435 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 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) [2022-12-14 13:54:01,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:54:01,456 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f274b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:54:01,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-14 13:54:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 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) [2022-12-14 13:54:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 13:54:01,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:01,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:01,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:01,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2121793894, now seen corresponding path program 1 times [2022-12-14 13:54:01,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:01,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567385826] [2022-12-14 13:54:01,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:01,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:54:01,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:01,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567385826] [2022-12-14 13:54:01,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567385826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:54:01,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:54:01,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:54:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916231794] [2022-12-14 13:54:01,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:54:01,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:54:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:54:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:54:01,735 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 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) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:01,773 INFO L93 Difference]: Finished difference Result 36 states and 76 transitions. [2022-12-14 13:54:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:54:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 [2022-12-14 13:54:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:01,781 INFO L225 Difference]: With dead ends: 36 [2022-12-14 13:54:01,781 INFO L226 Difference]: Without dead ends: 36 [2022-12-14 13:54:01,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:54:01,784 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:01,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:54:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-12-14 13:54:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-12-14 13:54:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 76 transitions. [2022-12-14 13:54:01,808 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 76 transitions. Word has length 14 [2022-12-14 13:54:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:01,808 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 76 transitions. [2022-12-14 13:54:01,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 76 transitions. [2022-12-14 13:54:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 13:54:01,809 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:01,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:01,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:54:01,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash -826920176, now seen corresponding path program 1 times [2022-12-14 13:54:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:01,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980927977] [2022-12-14 13:54:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:01,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:01,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980927977] [2022-12-14 13:54:01,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980927977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:54:01,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:54:01,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:54:01,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050635098] [2022-12-14 13:54:01,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:54:01,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:54:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:54:01,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:54:01,975 INFO L87 Difference]: Start difference. First operand 36 states and 76 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:02,007 INFO L93 Difference]: Finished difference Result 63 states and 137 transitions. [2022-12-14 13:54:02,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:54:02,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 13:54:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:02,009 INFO L225 Difference]: With dead ends: 63 [2022-12-14 13:54:02,009 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 13:54:02,010 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 [2022-12-14 13:54:02,011 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 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 [2022-12-14 13:54:02,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:54:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 13:54:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-14 13:54:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 127 transitions. [2022-12-14 13:54:02,016 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 127 transitions. Word has length 15 [2022-12-14 13:54:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:02,017 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 127 transitions. [2022-12-14 13:54:02,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 127 transitions. [2022-12-14 13:54:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:54:02,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:02,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:02,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:54:02,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1309395996, now seen corresponding path program 1 times [2022-12-14 13:54:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:02,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019240215] [2022-12-14 13:54:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:02,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:02,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019240215] [2022-12-14 13:54:02,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019240215] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:02,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858377224] [2022-12-14 13:54:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:02,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:02,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:02,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:02,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 13:54:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:02,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:54:02,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:02,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:02,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858377224] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:02,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:54:02,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 7 [2022-12-14 13:54:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583743766] [2022-12-14 13:54:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:54:02,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:54:02,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:02,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:54:02,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:54:02,277 INFO L87 Difference]: Start difference. First operand 58 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:02,345 INFO L93 Difference]: Finished difference Result 64 states and 141 transitions. [2022-12-14 13:54:02,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:54:02,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:54:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:02,346 INFO L225 Difference]: With dead ends: 64 [2022-12-14 13:54:02,346 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 13:54:02,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:54:02,347 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:02,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:54:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 13:54:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-12-14 13:54:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.358490566037736) internal successors, (125), 53 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 125 transitions. [2022-12-14 13:54:02,352 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 125 transitions. Word has length 16 [2022-12-14 13:54:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:02,352 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 125 transitions. [2022-12-14 13:54:02,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 125 transitions. [2022-12-14 13:54:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:54:02,353 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:02,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:02,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 13:54:02,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:02,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash -269954315, now seen corresponding path program 1 times [2022-12-14 13:54:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:02,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918890832] [2022-12-14 13:54:02,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:02,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:02,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918890832] [2022-12-14 13:54:02,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918890832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:54:02,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:54:02,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:54:02,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859907992] [2022-12-14 13:54:02,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:54:02,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:54:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:54:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:54:02,655 INFO L87 Difference]: Start difference. First operand 54 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:02,747 INFO L93 Difference]: Finished difference Result 82 states and 166 transitions. [2022-12-14 13:54:02,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:54:02,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:54:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:02,749 INFO L225 Difference]: With dead ends: 82 [2022-12-14 13:54:02,749 INFO L226 Difference]: Without dead ends: 68 [2022-12-14 13:54:02,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:54:02,750 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:02,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:54:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-14 13:54:02,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2022-12-14 13:54:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.288135593220339) internal successors, (135), 59 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 135 transitions. [2022-12-14 13:54:02,757 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 135 transitions. Word has length 16 [2022-12-14 13:54:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:02,757 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 135 transitions. [2022-12-14 13:54:02,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 135 transitions. [2022-12-14 13:54:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:54:02,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:02,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:02,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 13:54:02,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:02,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 658619716, now seen corresponding path program 2 times [2022-12-14 13:54:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:02,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788493103] [2022-12-14 13:54:02,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:02,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:02,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788493103] [2022-12-14 13:54:02,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788493103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:54:02,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:54:02,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:54:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182291874] [2022-12-14 13:54:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:54:02,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:54:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:54:02,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:54:02,888 INFO L87 Difference]: Start difference. First operand 60 states and 135 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:02,979 INFO L93 Difference]: Finished difference Result 86 states and 179 transitions. [2022-12-14 13:54:02,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:54:02,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:54:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:02,981 INFO L225 Difference]: With dead ends: 86 [2022-12-14 13:54:02,981 INFO L226 Difference]: Without dead ends: 86 [2022-12-14 13:54:02,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:54:02,982 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:02,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:54:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-14 13:54:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 62. [2022-12-14 13:54:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.3278688524590163) internal successors, (142), 61 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 142 transitions. [2022-12-14 13:54:02,987 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 142 transitions. Word has length 16 [2022-12-14 13:54:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:02,988 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 142 transitions. [2022-12-14 13:54:02,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 142 transitions. [2022-12-14 13:54:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:54:02,988 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:02,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:02,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 13:54:02,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash 221624339, now seen corresponding path program 2 times [2022-12-14 13:54:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:02,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434321727] [2022-12-14 13:54:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:03,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:03,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434321727] [2022-12-14 13:54:03,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434321727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:03,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835802892] [2022-12-14 13:54:03,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:54:03,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:03,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:03,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:03,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 13:54:03,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:54:03,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:54:03,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:54:03,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:03,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:03,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835802892] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:54:03,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [187771683] [2022-12-14 13:54:03,361 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 13:54:03,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:54:03,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-12-14 13:54:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813121058] [2022-12-14 13:54:03,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:54:03,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 13:54:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 13:54:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:54:03,364 INFO L87 Difference]: Start difference. First operand 62 states and 142 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:03,471 INFO L93 Difference]: Finished difference Result 90 states and 199 transitions. [2022-12-14 13:54:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:54:03,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:54:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:03,473 INFO L225 Difference]: With dead ends: 90 [2022-12-14 13:54:03,473 INFO L226 Difference]: Without dead ends: 90 [2022-12-14 13:54:03,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:54:03,474 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:03,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:54:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-14 13:54:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2022-12-14 13:54:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.3424657534246576) internal successors, (171), 73 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 171 transitions. [2022-12-14 13:54:03,481 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 171 transitions. Word has length 16 [2022-12-14 13:54:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:03,481 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 171 transitions. [2022-12-14 13:54:03,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 171 transitions. [2022-12-14 13:54:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:54:03,482 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:03,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:03,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 13:54:03,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 13:54:03,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:03,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -916706699, now seen corresponding path program 3 times [2022-12-14 13:54:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:03,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18339710] [2022-12-14 13:54:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:03,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:03,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18339710] [2022-12-14 13:54:03,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18339710] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:03,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303310340] [2022-12-14 13:54:03,857 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:54:03,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:03,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:03,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:03,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 13:54:03,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:54:03,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:54:03,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:54:03,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:03,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:03,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303310340] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:03,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:54:03,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 8 [2022-12-14 13:54:03,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499170028] [2022-12-14 13:54:03,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:54:03,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:54:03,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:03,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:54:03,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:54:03,992 INFO L87 Difference]: Start difference. First operand 74 states and 171 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:04,036 INFO L93 Difference]: Finished difference Result 78 states and 180 transitions. [2022-12-14 13:54:04,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:54:04,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:54:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:04,037 INFO L225 Difference]: With dead ends: 78 [2022-12-14 13:54:04,037 INFO L226 Difference]: Without dead ends: 78 [2022-12-14 13:54:04,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:54:04,038 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:04,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:54:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-14 13:54:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2022-12-14 13:54:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.2950819672131146) internal successors, (140), 61 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 140 transitions. [2022-12-14 13:54:04,042 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 140 transitions. Word has length 16 [2022-12-14 13:54:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:04,042 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 140 transitions. [2022-12-14 13:54:04,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 140 transitions. [2022-12-14 13:54:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 13:54:04,043 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:04,043 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:04,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 13:54:04,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:04,243 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1068618960, now seen corresponding path program 3 times [2022-12-14 13:54:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:04,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813343247] [2022-12-14 13:54:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:54:04,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:04,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813343247] [2022-12-14 13:54:04,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813343247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:54:04,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:54:04,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:54:04,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164120561] [2022-12-14 13:54:04,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:54:04,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:54:04,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:04,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:54:04,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:54:04,323 INFO L87 Difference]: Start difference. First operand 62 states and 140 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:04,380 INFO L93 Difference]: Finished difference Result 64 states and 141 transitions. [2022-12-14 13:54:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:54:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 13:54:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:04,381 INFO L225 Difference]: With dead ends: 64 [2022-12-14 13:54:04,381 INFO L226 Difference]: Without dead ends: 62 [2022-12-14 13:54:04,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:54:04,382 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:04,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:54:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-14 13:54:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-12-14 13:54:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.262295081967213) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 138 transitions. [2022-12-14 13:54:04,387 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 138 transitions. Word has length 17 [2022-12-14 13:54:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:04,387 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 138 transitions. [2022-12-14 13:54:04,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 138 transitions. [2022-12-14 13:54:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 13:54:04,388 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:04,388 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:04,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 13:54:04,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:04,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash 270794576, now seen corresponding path program 4 times [2022-12-14 13:54:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:04,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054158996] [2022-12-14 13:54:04,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:04,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:04,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054158996] [2022-12-14 13:54:04,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054158996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:04,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841819101] [2022-12-14 13:54:04,479 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:54:04,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:04,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:04,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:04,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 13:54:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:04,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:54:04,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:04,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:04,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841819101] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:54:04,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1160450050] [2022-12-14 13:54:04,622 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 13:54:04,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:54:04,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-14 13:54:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749399265] [2022-12-14 13:54:04,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:54:04,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 13:54:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 13:54:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:54:04,624 INFO L87 Difference]: Start difference. First operand 62 states and 138 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:04,697 INFO L93 Difference]: Finished difference Result 96 states and 209 transitions. [2022-12-14 13:54:04,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:54:04,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 [2022-12-14 13:54:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:04,699 INFO L225 Difference]: With dead ends: 96 [2022-12-14 13:54:04,699 INFO L226 Difference]: Without dead ends: 96 [2022-12-14 13:54:04,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:54:04,700 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:04,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:54:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-14 13:54:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2022-12-14 13:54:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.3384615384615386) internal successors, (152), 65 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 152 transitions. [2022-12-14 13:54:04,703 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 152 transitions. Word has length 17 [2022-12-14 13:54:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:04,703 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 152 transitions. [2022-12-14 13:54:04,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 152 transitions. [2022-12-14 13:54:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 13:54:04,704 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:04,704 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:04,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 13:54:04,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:04,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:04,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1575876848, now seen corresponding path program 5 times [2022-12-14 13:54:04,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:04,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639815652] [2022-12-14 13:54:04,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:04,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:54:04,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:04,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639815652] [2022-12-14 13:54:04,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639815652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:54:04,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:54:04,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:54:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857825488] [2022-12-14 13:54:04,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:54:04,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:54:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:04,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:54:04,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:54:04,980 INFO L87 Difference]: Start difference. First operand 66 states and 152 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:05,044 INFO L93 Difference]: Finished difference Result 82 states and 172 transitions. [2022-12-14 13:54:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:54:05,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 13:54:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:05,045 INFO L225 Difference]: With dead ends: 82 [2022-12-14 13:54:05,045 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 13:54:05,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:54:05,046 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:05,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:54:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 13:54:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2022-12-14 13:54:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.3015873015873014) internal successors, (145), 63 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 145 transitions. [2022-12-14 13:54:05,051 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 145 transitions. Word has length 17 [2022-12-14 13:54:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:05,051 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 145 transitions. [2022-12-14 13:54:05,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 145 transitions. [2022-12-14 13:54:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 13:54:05,052 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:05,052 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:05,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 13:54:05,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:05,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:05,053 INFO L85 PathProgramCache]: Analyzing trace with hash 108585838, now seen corresponding path program 6 times [2022-12-14 13:54:05,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:05,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972129732] [2022-12-14 13:54:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:05,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:05,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972129732] [2022-12-14 13:54:05,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972129732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735246882] [2022-12-14 13:54:05,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:54:05,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:05,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:05,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:05,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 13:54:05,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:54:05,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:54:05,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:54:05,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:54:05,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:54:05,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735246882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:54:05,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:54:05,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-12-14 13:54:05,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125121885] [2022-12-14 13:54:05,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:54:05,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:54:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:05,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:54:05,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:54:05,271 INFO L87 Difference]: Start difference. First operand 64 states and 145 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:05,337 INFO L93 Difference]: Finished difference Result 68 states and 149 transitions. [2022-12-14 13:54:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:54:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 13:54:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:05,338 INFO L225 Difference]: With dead ends: 68 [2022-12-14 13:54:05,338 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 13:54:05,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:54:05,338 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:05,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:54:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 13:54:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-12-14 13:54:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.2698412698412698) internal successors, (143), 63 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 143 transitions. [2022-12-14 13:54:05,343 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 143 transitions. Word has length 17 [2022-12-14 13:54:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:05,343 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 143 transitions. [2022-12-14 13:54:05,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 143 transitions. [2022-12-14 13:54:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 13:54:05,344 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:05,344 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:05,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 13:54:05,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 13:54:05,545 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:05,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2144597899, now seen corresponding path program 1 times [2022-12-14 13:54:05,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:05,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726562275] [2022-12-14 13:54:05,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:05,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:54:05,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:05,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726562275] [2022-12-14 13:54:05,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726562275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:05,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492226237] [2022-12-14 13:54:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:05,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:05,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:05,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:05,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 13:54:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:05,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 13:54:05,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:05,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 13:54:05,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 13:54:05,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:54:05,845 INFO L350 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 18 treesize of output 20 [2022-12-14 13:54:05,959 INFO L321 Elim1Store]: treesize reduction 41, result has 62.4 percent of original size [2022-12-14 13:54:05,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 101 [2022-12-14 13:54:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:06,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:06,368 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_272 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))) 4))) 4) c_~f~0.offset)))) (or (<= c_~size~0 .cse0) (< .cse0 0) (= c_~x1~0 (select .cse1 (+ (* .cse0 4) c_~f~0.offset))))))) is different from false [2022-12-14 13:54:06,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:06,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 173 [2022-12-14 13:54:06,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:06,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 596 treesize of output 584 [2022-12-14 13:54:06,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:06,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 590 treesize of output 446 [2022-12-14 13:54:06,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:06,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 296 treesize of output 302 [2022-12-14 13:54:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:09,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492226237] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:54:09,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1128384679] [2022-12-14 13:54:09,668 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 13:54:09,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:54:09,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-12-14 13:54:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904945544] [2022-12-14 13:54:09,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:54:09,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 13:54:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 13:54:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=171, Unknown=2, NotChecked=26, Total=240 [2022-12-14 13:54:09,670 INFO L87 Difference]: Start difference. First operand 64 states and 143 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 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) [2022-12-14 13:54:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:10,607 INFO L93 Difference]: Finished difference Result 165 states and 385 transitions. [2022-12-14 13:54:10,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 13:54:10,608 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 13:54:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:10,608 INFO L225 Difference]: With dead ends: 165 [2022-12-14 13:54:10,608 INFO L226 Difference]: Without dead ends: 79 [2022-12-14 13:54:10,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=717, Unknown=2, NotChecked=60, Total=1056 [2022-12-14 13:54:10,610 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 210 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:10,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 38 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 303 Invalid, 0 Unknown, 77 Unchecked, 0.3s Time] [2022-12-14 13:54:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-14 13:54:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-12-14 13:54:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.27027027027027) internal successors, (168), 74 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2022-12-14 13:54:10,613 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 18 [2022-12-14 13:54:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:10,613 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2022-12-14 13:54:10,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 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) [2022-12-14 13:54:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2022-12-14 13:54:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 13:54:10,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:10,613 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:10,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 13:54:10,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:10,815 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:10,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash -761352265, now seen corresponding path program 2 times [2022-12-14 13:54:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:10,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312969674] [2022-12-14 13:54:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:54:10,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:10,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312969674] [2022-12-14 13:54:10,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312969674] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:10,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909992397] [2022-12-14 13:54:10,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:54:10,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:10,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:10,967 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:10,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 13:54:11,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 13:54:11,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:54:11,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 13:54:11,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:54:11,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:54:11,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909992397] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:54:11,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1130871267] [2022-12-14 13:54:11,245 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 13:54:11,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:54:11,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-14 13:54:11,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494493310] [2022-12-14 13:54:11,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:54:11,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 13:54:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:11,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 13:54:11,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-14 13:54:11,247 INFO L87 Difference]: Start difference. First operand 75 states and 168 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:11,769 INFO L93 Difference]: Finished difference Result 149 states and 340 transitions. [2022-12-14 13:54:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 13:54:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 13:54:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:11,771 INFO L225 Difference]: With dead ends: 149 [2022-12-14 13:54:11,771 INFO L226 Difference]: Without dead ends: 149 [2022-12-14 13:54:11,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-14 13:54:11,772 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 90 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:11,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 33 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:54:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-14 13:54:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2022-12-14 13:54:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.403225806451613) internal successors, (298), 124 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 298 transitions. [2022-12-14 13:54:11,779 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 298 transitions. Word has length 20 [2022-12-14 13:54:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:11,779 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 298 transitions. [2022-12-14 13:54:11,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 298 transitions. [2022-12-14 13:54:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:54:11,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:11,780 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:11,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 13:54:11,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 13:54:11,982 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash -395270113, now seen corresponding path program 3 times [2022-12-14 13:54:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:11,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977846046] [2022-12-14 13:54:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:54:14,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:14,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977846046] [2022-12-14 13:54:14,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977846046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:14,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785296890] [2022-12-14 13:54:14,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:54:14,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:14,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:14,156 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:14,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 13:54:14,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:54:14,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:54:14,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 13:54:14,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:14,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:54:14,465 INFO L350 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 38 treesize of output 34 [2022-12-14 13:54:14,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:14,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-14 13:54:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:14,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:14,679 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 (Array Int Int))) (= (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_341) c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ (* (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset)) 4) c_~f~0.offset)))))))) is different from false [2022-12-14 13:54:15,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:15,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 364 [2022-12-14 13:54:15,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:15,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-14 13:54:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-12-14 13:54:17,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785296890] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:54:17,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1266222385] [2022-12-14 13:54:17,734 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 13:54:17,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:54:17,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-12-14 13:54:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137861984] [2022-12-14 13:54:17,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:54:17,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 13:54:17,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:17,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 13:54:17,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=564, Unknown=12, NotChecked=48, Total=702 [2022-12-14 13:54:17,737 INFO L87 Difference]: Start difference. First operand 125 states and 298 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:18,756 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~f~0.base)) (.cse2 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (forall ((v_ArrVal_341 (Array Int Int))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_341) c_~f~0.base))) (select .cse1 (+ c_~f~0.offset (* 4 (select .cse1 (+ (* (select .cse1 (+ (* (select .cse1 .cse2) 4) c_~f~0.offset)) 4) c_~f~0.offset)))))))) (forall ((v_ArrVal_341 (Array Int Int))) (= c_~x1~0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_341) c_~f~0.base))) (select .cse3 (+ c_~f~0.offset (* 4 (select .cse3 (+ (* (select .cse3 (+ (* (select .cse3 .cse2) 4) c_~f~0.offset)) 4) c_~f~0.offset)))))))) (= c_~x1~0 (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ (* (select .cse0 .cse2) 4) c_~f~0.offset))))) 4)))) (= c_~x1~0 c_~x2~0))) is different from false [2022-12-14 13:54:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:19,937 INFO L93 Difference]: Finished difference Result 322 states and 837 transitions. [2022-12-14 13:54:19,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 13:54:19,938 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:54:19,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:19,939 INFO L225 Difference]: With dead ends: 322 [2022-12-14 13:54:19,939 INFO L226 Difference]: Without dead ends: 317 [2022-12-14 13:54:19,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=168, Invalid=1084, Unknown=16, NotChecked=138, Total=1406 [2022-12-14 13:54:19,940 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 134 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 26 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:19,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 100 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 659 Invalid, 14 Unknown, 79 Unchecked, 1.6s Time] [2022-12-14 13:54:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-12-14 13:54:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2022-12-14 13:54:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 2.5852713178294575) internal successors, (667), 258 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 667 transitions. [2022-12-14 13:54:19,946 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 667 transitions. Word has length 21 [2022-12-14 13:54:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:19,946 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 667 transitions. [2022-12-14 13:54:19,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 667 transitions. [2022-12-14 13:54:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:54:19,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:19,947 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:19,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 13:54:20,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 13:54:20,149 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2027607263, now seen corresponding path program 4 times [2022-12-14 13:54:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:20,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807124161] [2022-12-14 13:54:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:54:22,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:22,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807124161] [2022-12-14 13:54:22,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807124161] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:22,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120048849] [2022-12-14 13:54:22,270 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:54:22,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:22,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:22,271 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:22,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 13:54:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:22,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 13:54:22,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:22,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:54:22,555 INFO L350 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 38 treesize of output 34 [2022-12-14 13:54:22,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:22,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-14 13:54:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:22,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:22,706 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array Int Int))) (= c_~x1~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset)) 4))) 4)))))) is different from false [2022-12-14 13:54:22,782 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array Int Int))) (= (let ((.cse0 (select |c_#memory_int| c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4)))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) c_~f~0.base))) (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ (* (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset)) 4))) 4)))))) is different from false [2022-12-14 13:54:23,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:23,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 364 [2022-12-14 13:54:23,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:23,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-14 13:54:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-12-14 13:54:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120048849] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:54:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1416668310] [2022-12-14 13:54:25,823 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 13:54:25,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:54:25,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-12-14 13:54:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254471210] [2022-12-14 13:54:25,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:54:25,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 13:54:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 13:54:25,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=520, Unknown=12, NotChecked=94, Total=702 [2022-12-14 13:54:25,825 INFO L87 Difference]: Start difference. First operand 259 states and 667 transitions. Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:26,860 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~f~0.base))) (let ((.cse2 (select .cse3 (+ (* c_~x1~0 4) c_~f~0.offset))) (.cse1 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (forall ((v_ArrVal_376 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 .cse1) 4) c_~f~0.offset)) 4))) 4)))) .cse2)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select .cse3 (+ c_~f~0.offset (* (select .cse3 (+ c_~f~0.offset (* .cse2 4))) 4))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) c_~f~0.base))) (select .cse4 (+ c_~f~0.offset (* (select .cse4 (+ c_~f~0.offset (* (select .cse4 (+ (* (select .cse4 .cse1) 4) c_~f~0.offset)) 4))) 4))))))))) is different from false [2022-12-14 13:54:27,008 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (forall ((v_ArrVal_376 (Array Int Int))) (= (let ((.cse0 (select |c_#memory_int| c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4)))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) c_~f~0.base))) (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ (* (select .cse1 .cse2) 4) c_~f~0.offset)) 4))) 4)))))) (forall ((v_ArrVal_376 (Array Int Int))) (= c_~x1~0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) c_~f~0.base))) (select .cse3 (+ c_~f~0.offset (* (select .cse3 (+ c_~f~0.offset (* (select .cse3 (+ (* (select .cse3 .cse2) 4) c_~f~0.offset)) 4))) 4)))))))) is different from false [2022-12-14 13:54:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:27,668 INFO L93 Difference]: Finished difference Result 453 states and 1145 transitions. [2022-12-14 13:54:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 13:54:27,669 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:54:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:27,671 INFO L225 Difference]: With dead ends: 453 [2022-12-14 13:54:27,671 INFO L226 Difference]: Without dead ends: 396 [2022-12-14 13:54:27,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=1036, Unknown=14, NotChecked=276, Total=1482 [2022-12-14 13:54:27,672 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 142 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 32 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:27,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 114 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 962 Invalid, 33 Unknown, 375 Unchecked, 1.2s Time] [2022-12-14 13:54:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-12-14 13:54:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 255. [2022-12-14 13:54:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 2.52755905511811) internal successors, (642), 254 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 642 transitions. [2022-12-14 13:54:27,678 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 642 transitions. Word has length 21 [2022-12-14 13:54:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:27,678 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 642 transitions. [2022-12-14 13:54:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 642 transitions. [2022-12-14 13:54:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:54:27,679 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:27,679 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:27,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 13:54:27,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 13:54:27,880 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:27,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -95098977, now seen corresponding path program 5 times [2022-12-14 13:54:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:27,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862345110] [2022-12-14 13:54:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:54:29,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:29,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862345110] [2022-12-14 13:54:29,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862345110] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:29,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916770773] [2022-12-14 13:54:29,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:54:29,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:29,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:29,370 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:29,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 13:54:29,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 13:54:29,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:54:29,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 13:54:29,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:29,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:54:29,647 INFO L350 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 30 treesize of output 28 [2022-12-14 13:54:29,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:29,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-14 13:54:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:29,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:29,846 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) c_~f~0.base))) (= (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4) c_~f~0.offset)) 4)))))) is different from false [2022-12-14 13:54:29,922 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (let ((.cse1 (select |c_#memory_int| c_~f~0.base))) (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ (* c_~x1~0 4) c_~f~0.offset)) 4)))) 4))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4) c_~f~0.offset)) 4)))))) is different from false [2022-12-14 13:54:30,185 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:30,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-14 13:54:30,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:30,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-14 13:54:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-12-14 13:54:34,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916770773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:54:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [56724665] [2022-12-14 13:54:34,027 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 13:54:34,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:54:34,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-12-14 13:54:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967907477] [2022-12-14 13:54:34,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:54:34,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 13:54:34,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 13:54:34,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=525, Unknown=3, NotChecked=94, Total=702 [2022-12-14 13:54:34,029 INFO L87 Difference]: Start difference. First operand 255 states and 642 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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) [2022-12-14 13:54:36,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 13:54:37,267 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~x1~0 4) c_~f~0.offset)) (.cse2 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (forall ((v_ArrVal_411 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) c_~f~0.base))) (= (select .cse0 .cse1) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 .cse2) 4))) 4) c_~f~0.offset)) 4)))))) (forall ((v_ArrVal_411 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) c_~f~0.base))) (= (select .cse3 (+ c_~f~0.offset (* (let ((.cse4 (select |c_#memory_int| c_~f~0.base))) (select .cse4 (+ c_~f~0.offset (* (select .cse4 .cse1) 4)))) 4))) (select .cse3 (+ c_~f~0.offset (* (select .cse3 (+ (* (select .cse3 (+ c_~f~0.offset (* (select .cse3 .cse2) 4))) 4) c_~f~0.offset)) 4)))))))) is different from false [2022-12-14 13:54:39,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 13:54:39,311 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)) 4))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4) c_~f~0.offset)) 4)))))) (= c_~x1~0 c_~x2~0)) is different from false [2022-12-14 13:54:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:39,454 INFO L93 Difference]: Finished difference Result 329 states and 825 transitions. [2022-12-14 13:54:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 13:54:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:54:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:39,455 INFO L225 Difference]: With dead ends: 329 [2022-12-14 13:54:39,455 INFO L226 Difference]: Without dead ends: 324 [2022-12-14 13:54:39,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=1035, Unknown=5, NotChecked=276, Total=1482 [2022-12-14 13:54:39,456 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 118 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 24 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:39,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 69 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 497 Invalid, 24 Unknown, 250 Unchecked, 4.7s Time] [2022-12-14 13:54:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-12-14 13:54:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 261. [2022-12-14 13:54:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 2.5346153846153845) internal successors, (659), 260 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 659 transitions. [2022-12-14 13:54:39,461 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 659 transitions. Word has length 21 [2022-12-14 13:54:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:39,462 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 659 transitions. [2022-12-14 13:54:39,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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) [2022-12-14 13:54:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 659 transitions. [2022-12-14 13:54:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:54:39,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:39,462 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:39,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 13:54:39,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 13:54:39,664 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:39,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1733764739, now seen corresponding path program 6 times [2022-12-14 13:54:39,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:39,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150849022] [2022-12-14 13:54:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:39,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:54:41,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150849022] [2022-12-14 13:54:41,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150849022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935861057] [2022-12-14 13:54:41,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:54:41,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:41,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:41,590 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:41,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 13:54:41,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:54:41,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:54:41,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 13:54:41,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:41,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:54:41,827 INFO L350 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 22 treesize of output 22 [2022-12-14 13:54:41,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:41,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-14 13:54:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:41,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:42,181 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_446 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_446) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* 4 (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset))) c_~f~0.offset)) 4))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)) 4))) 4)))))) is different from false [2022-12-14 13:54:42,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:42,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 376 [2022-12-14 13:54:42,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:42,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 196 [2022-12-14 13:54:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-12-14 13:54:47,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935861057] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:54:47,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [691005195] [2022-12-14 13:54:47,002 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 13:54:47,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:54:47,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-12-14 13:54:47,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013540911] [2022-12-14 13:54:47,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:54:47,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 13:54:47,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:47,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 13:54:47,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=573, Unknown=7, NotChecked=48, Total=702 [2022-12-14 13:54:47,003 INFO L87 Difference]: Start difference. First operand 261 states and 659 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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) [2022-12-14 13:54:48,614 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_446 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_446) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* 4 (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset))) c_~f~0.offset)) 4))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4)))))) (= c_~x1~0 c_~x2~0)) is different from false [2022-12-14 13:54:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:48,803 INFO L93 Difference]: Finished difference Result 325 states and 825 transitions. [2022-12-14 13:54:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 13:54:48,804 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:54:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:48,806 INFO L225 Difference]: With dead ends: 325 [2022-12-14 13:54:48,806 INFO L226 Difference]: Without dead ends: 320 [2022-12-14 13:54:48,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=1232, Unknown=11, NotChecked=146, Total=1560 [2022-12-14 13:54:48,807 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 105 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 27 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:48,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 74 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 677 Invalid, 17 Unknown, 60 Unchecked, 0.8s Time] [2022-12-14 13:54:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-12-14 13:54:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 274. [2022-12-14 13:54:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.567765567765568) internal successors, (701), 273 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 701 transitions. [2022-12-14 13:54:48,813 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 701 transitions. Word has length 21 [2022-12-14 13:54:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:48,813 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 701 transitions. [2022-12-14 13:54:48,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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) [2022-12-14 13:54:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 701 transitions. [2022-12-14 13:54:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:54:48,814 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:48,814 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:48,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 13:54:49,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 13:54:49,015 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash -992795809, now seen corresponding path program 7 times [2022-12-14 13:54:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:49,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963642307] [2022-12-14 13:54:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:54:50,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:50,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963642307] [2022-12-14 13:54:50,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963642307] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:50,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287978022] [2022-12-14 13:54:50,795 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:54:50,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:50,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:50,796 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:50,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 13:54:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:50,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 13:54:50,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:50,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:54:50,994 INFO L350 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 14 treesize of output 16 [2022-12-14 13:54:51,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:51,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-14 13:54:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:54:51,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:54:51,260 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_481 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_481) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4)))))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset)) 4) c_~f~0.offset)) 4)))))) is different from false [2022-12-14 13:54:51,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:51,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-14 13:54:51,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:54:51,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-14 13:54:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:54:56,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287978022] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:54:56,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1139704420] [2022-12-14 13:54:56,269 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 13:54:56,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:54:56,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-12-14 13:54:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057393672] [2022-12-14 13:54:56,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:54:56,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 13:54:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:54:56,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 13:54:56,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2022-12-14 13:54:56,271 INFO L87 Difference]: Start difference. First operand 274 states and 701 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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) [2022-12-14 13:54:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:54:57,663 INFO L93 Difference]: Finished difference Result 482 states and 1199 transitions. [2022-12-14 13:54:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 13:54:57,664 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:54:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:54:57,665 INFO L225 Difference]: With dead ends: 482 [2022-12-14 13:54:57,665 INFO L226 Difference]: Without dead ends: 460 [2022-12-14 13:54:57,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=187, Invalid=1298, Unknown=1, NotChecked=74, Total=1560 [2022-12-14 13:54:57,666 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 154 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:54:57,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 61 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 698 Invalid, 0 Unknown, 82 Unchecked, 0.7s Time] [2022-12-14 13:54:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-12-14 13:54:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 360. [2022-12-14 13:54:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.6963788300835656) internal successors, (968), 359 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:54:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 968 transitions. [2022-12-14 13:54:57,674 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 968 transitions. Word has length 21 [2022-12-14 13:54:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:54:57,674 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 968 transitions. [2022-12-14 13:54:57,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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) [2022-12-14 13:54:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 968 transitions. [2022-12-14 13:54:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:54:57,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:54:57,675 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:54:57,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 13:54:57,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 13:54:57,876 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 13:54:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:54:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash 502404541, now seen corresponding path program 8 times [2022-12-14 13:54:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:54:57,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920718226] [2022-12-14 13:54:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:54:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:54:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:54:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:54:59,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:54:59,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920718226] [2022-12-14 13:54:59,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920718226] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:54:59,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352145957] [2022-12-14 13:54:59,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:54:59,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:54:59,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:54:59,404 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:54:59,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c65a6e63-fe2d-46bd-a3d2-b1a5370efed1/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 13:54:59,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 13:54:59,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:54:59,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 13:54:59,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:54:59,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 13:54:59,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 13:54:59,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 13:55:00,041 INFO L321 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-12-14 13:55:00,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 48 [2022-12-14 13:55:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:55:00,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:55:00,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:55:00,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 818 treesize of output 470 [2022-12-14 13:55:01,450 INFO L321 Elim1Store]: treesize reduction 5, result has 98.2 percent of original size [2022-12-14 13:55:01,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 2620 treesize of output 2459 [2022-12-14 13:55:01,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:55:01,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:55:01,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 27 case distinctions, treesize of input 1586 treesize of output 1538 [2022-12-14 13:55:02,749 INFO L321 Elim1Store]: treesize reduction 12, result has 95.7 percent of original size [2022-12-14 13:55:02,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 1780 treesize of output 1372