./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8 --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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:58:33,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:58:33,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:58:33,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:58:33,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:58:33,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:58:33,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:58:33,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:58:33,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:58:33,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:58:33,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:58:33,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:58:33,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:58:33,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:58:33,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:58:33,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:58:33,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:58:33,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:58:33,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:58:33,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:58:33,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:58:33,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:58:33,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:58:33,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:58:33,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:58:33,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:58:33,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:58:33,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:58:33,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:58:33,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:58:33,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:58:33,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:58:33,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:58:33,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:58:33,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:58:33,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:58:33,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:58:33,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:58:33,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:58:33,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:58:33,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:58:33,260 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:58:33,307 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:58:33,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:58:33,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:58:33,313 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:58:33,314 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:58:33,314 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:58:33,314 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:58:33,314 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:58:33,315 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:58:33,315 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:58:33,321 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:58:33,325 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:58:33,325 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:58:33,326 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:58:33,326 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:58:33,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:58:33,328 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:58:33,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:58:33,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:58:33,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:58:33,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:58:33,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:58:33,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:58:33,330 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:58:33,330 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:58:33,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:58:33,331 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:58:33,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:58:33,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:58:33,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:58:33,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:58:33,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:58:33,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:58:33,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:58:33,334 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:58:33,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:58:33,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:58:33,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:58:33,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:58:33,335 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/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_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2021-11-07 01:58:33,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:58:33,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:58:33,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:58:33,793 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:58:33,794 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:58:33,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/pthread/triangular-longest-2.i [2021-11-07 01:58:33,877 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/data/884479f87/87633c97bbed4ff8816f40e5b054ab7a/FLAG65ed48753 [2021-11-07 01:58:34,572 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:58:34,573 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/sv-benchmarks/c/pthread/triangular-longest-2.i [2021-11-07 01:58:34,589 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/data/884479f87/87633c97bbed4ff8816f40e5b054ab7a/FLAG65ed48753 [2021-11-07 01:58:34,756 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/data/884479f87/87633c97bbed4ff8816f40e5b054ab7a [2021-11-07 01:58:34,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:58:34,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:58:34,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:58:34,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:58:34,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:58:34,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:58:34" (1/1) ... [2021-11-07 01:58:34,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe3f6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:34, skipping insertion in model container [2021-11-07 01:58:34,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:58:34" (1/1) ... [2021-11-07 01:58:34,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:58:34,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:58:35,409 WARN L228 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_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2021-11-07 01:58:35,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:58:35,423 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:58:35,466 WARN L228 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_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2021-11-07 01:58:35,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:58:35,501 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:58:35,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35 WrapperNode [2021-11-07 01:58:35,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:58:35,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:58:35,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:58:35,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:58:35,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:58:35,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:58:35,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:58:35,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:58:35,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:58:35,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:58:35,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:58:35,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:58:35,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (1/1) ... [2021-11-07 01:58:35,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:58:35,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:58:35,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:58:35,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:58:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-07 01:58:35,665 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-07 01:58:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-07 01:58:35,668 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-07 01:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 01:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-07 01:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-07 01:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:58:35,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:58:35,671 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-07 01:58:36,126 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:58:36,127 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-07 01:58:36,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:36 BoogieIcfgContainer [2021-11-07 01:58:36,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:58:36,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:58:36,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:58:36,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:58:36,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:58:34" (1/3) ... [2021-11-07 01:58:36,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff3f6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:58:36, skipping insertion in model container [2021-11-07 01:58:36,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:35" (2/3) ... [2021-11-07 01:58:36,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff3f6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:58:36, skipping insertion in model container [2021-11-07 01:58:36,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:36" (3/3) ... [2021-11-07 01:58:36,150 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2021-11-07 01:58:36,157 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-07 01:58:36,157 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:58:36,158 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:58:36,158 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-07 01:58:36,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,206 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,206 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,206 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,206 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,207 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,207 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,208 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,209 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,210 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,210 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,212 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,213 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,214 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,214 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,214 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,215 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,215 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,215 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,216 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,217 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,217 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,218 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,219 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,219 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,219 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,220 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,221 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,222 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,222 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,222 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,223 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,223 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,224 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,224 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,224 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,225 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,225 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,225 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,226 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,226 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,226 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,226 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,228 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,228 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,229 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,229 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,229 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,229 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,230 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,230 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,233 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,233 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,240 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,241 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,241 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,241 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,242 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,242 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,247 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,248 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,248 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,248 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,249 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,249 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:58:36,251 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-07 01:58:36,307 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:58:36,315 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:58:36,315 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-07 01:58:36,348 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-07 01:58:36,362 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 66 transitions, 142 flow [2021-11-07 01:58:36,366 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 66 transitions, 142 flow [2021-11-07 01:58:36,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 142 flow [2021-11-07 01:58:36,420 INFO L129 PetriNetUnfolder]: 5/64 cut-off events. [2021-11-07 01:58:36,421 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-07 01:58:36,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-11-07 01:58:36,431 INFO L116 LiptonReduction]: Number of co-enabled transitions 1078 [2021-11-07 01:58:40,305 INFO L131 LiptonReduction]: Checked pairs total: 1010 [2021-11-07 01:58:40,306 INFO L133 LiptonReduction]: Total number of compositions: 58 [2021-11-07 01:58:40,316 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 40 flow [2021-11-07 01:58:40,332 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 01:58:40,341 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:40,342 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 01:58:40,343 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:40,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash -776411381, now seen corresponding path program 1 times [2021-11-07 01:58:40,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:40,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257248364] [2021-11-07 01:58:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:40,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:40,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:40,673 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:40,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257248364] [2021-11-07 01:58:40,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257248364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:58:40,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:58:40,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:58:40,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280202831] [2021-11-07 01:58:40,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:58:40,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:58:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:58:40,716 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:58:40,776 INFO L93 Difference]: Finished difference Result 44 states and 107 transitions. [2021-11-07 01:58:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:58:40,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-07 01:58:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:58:40,788 INFO L225 Difference]: With dead ends: 44 [2021-11-07 01:58:40,788 INFO L226 Difference]: Without dead ends: 38 [2021-11-07 01:58:40,790 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:58:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-07 01:58:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-07 01:58:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2021-11-07 01:58:40,827 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 92 transitions. Word has length 6 [2021-11-07 01:58:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:58:40,827 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 92 transitions. [2021-11-07 01:58:40,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 92 transitions. [2021-11-07 01:58:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 01:58:40,829 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:40,829 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:58:40,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:58:40,830 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:40,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1192430633, now seen corresponding path program 1 times [2021-11-07 01:58:40,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:40,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397104893] [2021-11-07 01:58:40,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:40,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:40,977 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:40,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397104893] [2021-11-07 01:58:40,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397104893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:58:40,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:58:40,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:58:40,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098015863] [2021-11-07 01:58:40,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:58:40,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:40,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:58:40,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:58:40,984 INFO L87 Difference]: Start difference. First operand 38 states and 92 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:58:41,073 INFO L93 Difference]: Finished difference Result 64 states and 150 transitions. [2021-11-07 01:58:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:58:41,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-07 01:58:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:58:41,076 INFO L225 Difference]: With dead ends: 64 [2021-11-07 01:58:41,078 INFO L226 Difference]: Without dead ends: 50 [2021-11-07 01:58:41,079 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:58:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-07 01:58:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-11-07 01:58:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 41 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2021-11-07 01:58:41,100 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2021-11-07 01:58:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:58:41,101 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2021-11-07 01:58:41,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2021-11-07 01:58:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:58:41,104 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:41,105 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:58:41,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:58:41,106 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:41,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash -830913789, now seen corresponding path program 1 times [2021-11-07 01:58:41,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:41,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493982544] [2021-11-07 01:58:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:41,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:41,265 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:41,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493982544] [2021-11-07 01:58:41,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493982544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:58:41,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:58:41,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:58:41,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923676021] [2021-11-07 01:58:41,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:58:41,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:41,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:58:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:58:41,269 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:58:41,448 INFO L93 Difference]: Finished difference Result 58 states and 136 transitions. [2021-11-07 01:58:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:58:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 01:58:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:58:41,451 INFO L225 Difference]: With dead ends: 58 [2021-11-07 01:58:41,451 INFO L226 Difference]: Without dead ends: 52 [2021-11-07 01:58:41,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:58:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-07 01:58:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2021-11-07 01:58:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 37 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2021-11-07 01:58:41,473 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 90 transitions. Word has length 10 [2021-11-07 01:58:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:58:41,474 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 90 transitions. [2021-11-07 01:58:41,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 90 transitions. [2021-11-07 01:58:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:58:41,476 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:41,477 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:58:41,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:58:41,481 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash -855995889, now seen corresponding path program 2 times [2021-11-07 01:58:41,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:41,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835230488] [2021-11-07 01:58:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:41,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:41,588 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:41,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835230488] [2021-11-07 01:58:41,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835230488] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:58:41,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:58:41,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:58:41,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965009274] [2021-11-07 01:58:41,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:58:41,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:58:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:58:41,597 INFO L87 Difference]: Start difference. First operand 38 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:58:41,697 INFO L93 Difference]: Finished difference Result 60 states and 142 transitions. [2021-11-07 01:58:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:58:41,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 01:58:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:58:41,703 INFO L225 Difference]: With dead ends: 60 [2021-11-07 01:58:41,703 INFO L226 Difference]: Without dead ends: 47 [2021-11-07 01:58:41,703 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:58:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-07 01:58:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2021-11-07 01:58:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2021-11-07 01:58:41,720 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 10 [2021-11-07 01:58:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:58:41,721 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2021-11-07 01:58:41,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2021-11-07 01:58:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:58:41,722 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:41,722 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:58:41,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:58:41,723 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:41,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 11487317, now seen corresponding path program 3 times [2021-11-07 01:58:41,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:41,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979896206] [2021-11-07 01:58:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:41,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:41,850 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:41,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979896206] [2021-11-07 01:58:41,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979896206] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:58:41,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069719030] [2021-11-07 01:58:41,851 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 01:58:41,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:41,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:58:41,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:58:41,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:58:41,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 01:58:41,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:58:41,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 01:58:42,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:58:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:42,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:58:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:42,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069719030] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:58:42,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1830746188] [2021-11-07 01:58:42,493 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-07 01:58:42,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:58:42,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-11-07 01:58:42,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642688879] [2021-11-07 01:58:42,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:58:42,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:58:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:58:42,501 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:58:42,907 INFO L93 Difference]: Finished difference Result 89 states and 215 transitions. [2021-11-07 01:58:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:58:42,908 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 01:58:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:58:42,909 INFO L225 Difference]: With dead ends: 89 [2021-11-07 01:58:42,909 INFO L226 Difference]: Without dead ends: 54 [2021-11-07 01:58:42,910 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:58:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-07 01:58:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2021-11-07 01:58:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2021-11-07 01:58:42,925 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 117 transitions. Word has length 11 [2021-11-07 01:58:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:58:42,926 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 117 transitions. [2021-11-07 01:58:42,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 117 transitions. [2021-11-07 01:58:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:58:42,927 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:42,927 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:58:42,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-07 01:58:43,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:43,128 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:43,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1743618811, now seen corresponding path program 4 times [2021-11-07 01:58:43,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:43,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160216604] [2021-11-07 01:58:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:43,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:43,293 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:43,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160216604] [2021-11-07 01:58:43,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160216604] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:58:43,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656495878] [2021-11-07 01:58:43,295 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 01:58:43,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:43,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:58:43,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:58:43,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:58:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:43,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-07 01:58:43,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:58:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:43,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:58:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:43,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656495878] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:58:43,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [998947735] [2021-11-07 01:58:43,790 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-07 01:58:43,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:58:43,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2021-11-07 01:58:43,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495736141] [2021-11-07 01:58:43,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:58:43,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:43,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:58:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:58:43,796 INFO L87 Difference]: Start difference. First operand 49 states and 117 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 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) [2021-11-07 01:58:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:58:44,345 INFO L93 Difference]: Finished difference Result 117 states and 284 transitions. [2021-11-07 01:58:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 01:58:44,355 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 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 13 [2021-11-07 01:58:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:58:44,356 INFO L225 Difference]: With dead ends: 117 [2021-11-07 01:58:44,356 INFO L226 Difference]: Without dead ends: 78 [2021-11-07 01:58:44,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=401, Invalid=859, Unknown=0, NotChecked=0, Total=1260 [2021-11-07 01:58:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-07 01:58:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2021-11-07 01:58:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.4893617021276597) internal successors, (117), 47 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 117 transitions. [2021-11-07 01:58:44,368 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 117 transitions. Word has length 13 [2021-11-07 01:58:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:58:44,368 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 117 transitions. [2021-11-07 01:58:44,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 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) [2021-11-07 01:58:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 117 transitions. [2021-11-07 01:58:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:58:44,371 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:44,372 INFO L513 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:58:44,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:58:44,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-07 01:58:44,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash 470750213, now seen corresponding path program 5 times [2021-11-07 01:58:44,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:44,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368586588] [2021-11-07 01:58:44,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:44,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:58:44,769 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:44,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368586588] [2021-11-07 01:58:44,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368586588] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:58:44,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437944333] [2021-11-07 01:58:44,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:58:44,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:44,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:58:44,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:58:44,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:58:44,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-07 01:58:44,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:58:44,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-07 01:58:44,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:58:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:58:45,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:58:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:58:45,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437944333] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:58:45,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2063815919] [2021-11-07 01:58:45,328 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-07 01:58:45,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:58:45,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2021-11-07 01:58:45,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004089992] [2021-11-07 01:58:45,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-07 01:58:45,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-07 01:58:45,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:58:45,331 INFO L87 Difference]: Start difference. First operand 48 states and 117 transitions. Second operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:58:46,489 INFO L93 Difference]: Finished difference Result 202 states and 495 transitions. [2021-11-07 01:58:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-07 01:58:46,490 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 01:58:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:58:46,492 INFO L225 Difference]: With dead ends: 202 [2021-11-07 01:58:46,493 INFO L226 Difference]: Without dead ends: 127 [2021-11-07 01:58:46,495 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1190, Invalid=2592, Unknown=0, NotChecked=0, Total=3782 [2021-11-07 01:58:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-07 01:58:46,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 72. [2021-11-07 01:58:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.4507042253521125) internal successors, (174), 71 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 174 transitions. [2021-11-07 01:58:46,505 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 174 transitions. Word has length 18 [2021-11-07 01:58:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:58:46,505 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 174 transitions. [2021-11-07 01:58:46,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 174 transitions. [2021-11-07 01:58:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:58:46,507 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:46,507 INFO L513 BasicCegarLoop]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:58:46,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:58:46,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:46,733 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash -787639669, now seen corresponding path program 6 times [2021-11-07 01:58:46,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:46,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102621689] [2021-11-07 01:58:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:46,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:58:47,021 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:47,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102621689] [2021-11-07 01:58:47,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102621689] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:58:47,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27321624] [2021-11-07 01:58:47,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 01:58:47,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:47,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:58:47,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:58:47,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 01:58:47,184 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 01:58:47,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:58:47,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-07 01:58:47,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:58:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:58:47,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:58:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:58:47,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27321624] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:58:47,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [68484241] [2021-11-07 01:58:47,932 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-07 01:58:47,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:58:47,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 35 [2021-11-07 01:58:47,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133921128] [2021-11-07 01:58:47,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-07 01:58:47,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:47,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-07 01:58:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 01:58:47,935 INFO L87 Difference]: Start difference. First operand 72 states and 174 transitions. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 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) [2021-11-07 01:58:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:58:50,043 INFO L93 Difference]: Finished difference Result 289 states and 710 transitions. [2021-11-07 01:58:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-07 01:58:50,044 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 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 24 [2021-11-07 01:58:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:58:50,050 INFO L225 Difference]: With dead ends: 289 [2021-11-07 01:58:50,053 INFO L226 Difference]: Without dead ends: 185 [2021-11-07 01:58:50,056 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2821, Invalid=6299, Unknown=0, NotChecked=0, Total=9120 [2021-11-07 01:58:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-07 01:58:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 88. [2021-11-07 01:58:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.4942528735632186) internal successors, (217), 87 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 217 transitions. [2021-11-07 01:58:50,072 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 217 transitions. Word has length 24 [2021-11-07 01:58:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:58:50,072 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 217 transitions. [2021-11-07 01:58:50,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 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) [2021-11-07 01:58:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 217 transitions. [2021-11-07 01:58:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 01:58:50,085 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:50,085 INFO L513 BasicCegarLoop]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:58:50,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-07 01:58:50,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:50,290 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:50,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:50,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1584034491, now seen corresponding path program 7 times [2021-11-07 01:58:50,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:50,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277655743] [2021-11-07 01:58:50,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:50,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:58:50,818 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:50,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277655743] [2021-11-07 01:58:50,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277655743] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:58:50,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343836136] [2021-11-07 01:58:50,819 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 01:58:50,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:50,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:58:50,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:58:50,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 01:58:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:51,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-07 01:58:51,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:58:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:58:51,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:58:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:58:52,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343836136] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:58:52,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1884246717] [2021-11-07 01:58:52,379 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-07 01:58:52,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:58:52,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 63 [2021-11-07 01:58:52,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008874424] [2021-11-07 01:58:52,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-11-07 01:58:52,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-11-07 01:58:52,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=970, Invalid=3190, Unknown=0, NotChecked=0, Total=4160 [2021-11-07 01:58:52,384 INFO L87 Difference]: Start difference. First operand 88 states and 217 transitions. Second operand has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:58:55,709 INFO L93 Difference]: Finished difference Result 326 states and 809 transitions. [2021-11-07 01:58:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-11-07 01:58:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-07 01:58:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:58:55,713 INFO L225 Difference]: With dead ends: 326 [2021-11-07 01:58:55,714 INFO L226 Difference]: Without dead ends: 239 [2021-11-07 01:58:55,722 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6920 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6430, Invalid=15326, Unknown=0, NotChecked=0, Total=21756 [2021-11-07 01:58:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-07 01:58:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 117. [2021-11-07 01:58:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.4741379310344827) internal successors, (287), 116 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 287 transitions. [2021-11-07 01:58:55,733 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 287 transitions. Word has length 38 [2021-11-07 01:58:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:58:55,734 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 287 transitions. [2021-11-07 01:58:55,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:58:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 287 transitions. [2021-11-07 01:58:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 01:58:55,736 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:58:55,737 INFO L513 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:58:55,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-07 01:58:55,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:55,958 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:58:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:58:55,958 INFO L85 PathProgramCache]: Analyzing trace with hash -327037149, now seen corresponding path program 8 times [2021-11-07 01:58:55,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:58:55,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227671137] [2021-11-07 01:58:55,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:58:55,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:58:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:58:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:56,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:58:56,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227671137] [2021-11-07 01:58:56,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227671137] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:58:56,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841663291] [2021-11-07 01:58:56,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:58:56,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:58:56,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:58:56,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:58:56,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 01:58:57,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2021-11-07 01:58:57,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:58:57,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-07 01:58:57,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:58:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:57,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:58:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:58:57,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841663291] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:58:57,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [293059341] [2021-11-07 01:58:57,715 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-07 01:58:57,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:58:57,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 43 [2021-11-07 01:58:57,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312913504] [2021-11-07 01:58:57,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-07 01:58:57,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:58:57,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-07 01:58:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2021-11-07 01:58:57,725 INFO L87 Difference]: Start difference. First operand 117 states and 287 transitions. Second operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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) [2021-11-07 01:59:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:59:00,700 INFO L93 Difference]: Finished difference Result 204 states and 503 transitions. [2021-11-07 01:59:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-11-07 01:59:00,700 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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 47 [2021-11-07 01:59:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:59:00,703 INFO L225 Difference]: With dead ends: 204 [2021-11-07 01:59:00,703 INFO L226 Difference]: Without dead ends: 199 [2021-11-07 01:59:00,709 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4159, Invalid=11093, Unknown=0, NotChecked=0, Total=15252 [2021-11-07 01:59:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-07 01:59:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 157. [2021-11-07 01:59:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.608974358974359) internal successors, (407), 156 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:59:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 407 transitions. [2021-11-07 01:59:00,720 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 407 transitions. Word has length 47 [2021-11-07 01:59:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:59:00,721 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 407 transitions. [2021-11-07 01:59:00,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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) [2021-11-07 01:59:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 407 transitions. [2021-11-07 01:59:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 01:59:00,724 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:59:00,724 INFO L513 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:59:00,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-07 01:59:00,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-07 01:59:00,938 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-07 01:59:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:59:00,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1548206027, now seen corresponding path program 9 times [2021-11-07 01:59:00,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:59:00,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968428563] [2021-11-07 01:59:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:59:00,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:59:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:59:01,005 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:59:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:59:01,114 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:59:01,114 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:59:01,115 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:59:01,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-07 01:59:01,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-07 01:59:01,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:59:01,122 INFO L731 BasicCegarLoop]: Path program histogram: [9, 1, 1] [2021-11-07 01:59:01,128 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-07 01:59:01,128 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:59:01,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:59:01 BasicIcfg [2021-11-07 01:59:01,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:59:01,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:59:01,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:59:01,298 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:59:01,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:36" (3/4) ... [2021-11-07 01:59:01,301 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:59:01,448 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:59:01,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:59:01,451 INFO L168 Benchmark]: Toolchain (without parser) took 26689.20 ms. Allocated memory was 119.5 MB in the beginning and 224.4 MB in the end (delta: 104.9 MB). Free memory was 82.1 MB in the beginning and 172.7 MB in the end (delta: -90.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 16.1 GB. [2021-11-07 01:59:01,451 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 119.5 MB. Free memory was 100.3 MB in the beginning and 100.3 MB in the end (delta: 58.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:59:01,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.12 ms. Allocated memory is still 119.5 MB. Free memory was 81.9 MB in the beginning and 86.7 MB in the end (delta: -4.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:59:01,452 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.93 ms. Allocated memory is still 119.5 MB. Free memory was 86.7 MB in the beginning and 84.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:59:01,453 INFO L168 Benchmark]: Boogie Preprocessor took 27.65 ms. Allocated memory is still 119.5 MB. Free memory was 84.5 MB in the beginning and 83.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:59:01,453 INFO L168 Benchmark]: RCFGBuilder took 557.31 ms. Allocated memory is still 119.5 MB. Free memory was 83.3 MB in the beginning and 72.0 MB in the end (delta: 11.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:59:01,454 INFO L168 Benchmark]: TraceAbstraction took 25160.35 ms. Allocated memory was 119.5 MB in the beginning and 224.4 MB in the end (delta: 104.9 MB). Free memory was 71.6 MB in the beginning and 187.4 MB in the end (delta: -115.8 MB). Peak memory consumption was 111.9 MB. Max. memory is 16.1 GB. [2021-11-07 01:59:01,455 INFO L168 Benchmark]: Witness Printer took 151.43 ms. Allocated memory is still 224.4 MB. Free memory was 187.4 MB in the beginning and 172.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:59:01,458 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 119.5 MB. Free memory was 100.3 MB in the beginning and 100.3 MB in the end (delta: 58.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 740.12 ms. Allocated memory is still 119.5 MB. Free memory was 81.9 MB in the beginning and 86.7 MB in the end (delta: -4.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.93 ms. Allocated memory is still 119.5 MB. Free memory was 86.7 MB in the beginning and 84.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.65 ms. Allocated memory is still 119.5 MB. Free memory was 84.5 MB in the beginning and 83.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 557.31 ms. Allocated memory is still 119.5 MB. Free memory was 83.3 MB in the beginning and 72.0 MB in the end (delta: 11.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25160.35 ms. Allocated memory was 119.5 MB in the beginning and 224.4 MB in the end (delta: 104.9 MB). Free memory was 71.6 MB in the beginning and 187.4 MB in the end (delta: -115.8 MB). Peak memory consumption was 111.9 MB. Max. memory is 16.1 GB. * Witness Printer took 151.43 ms. Allocated memory is still 224.4 MB. Free memory was 187.4 MB in the beginning and 172.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 68 PlacesBefore, 20 PlacesAfterwards, 66 TransitionsBefore, 15 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 58 TotalNumberOfCompositions, 1010 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 867, positive: 842, positive conditional: 0, positive unconditional: 842, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 710, positive: 695, positive conditional: 0, positive unconditional: 695, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 710, positive: 695, positive conditional: 0, positive unconditional: 695, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 867, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 710, unknown conditional: 0, unknown unconditional: 710] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1, k=0] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=8, k=7] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=9, k=8] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=10] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=13, k=12] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=14, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=15, k=14] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=17, k=16] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=18, k=17] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L716] 0 int condI = i >= (2*20 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 int condJ = j >= (2*20 +6); [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 84 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 11, TraceHistogramMax: 20, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 154 SDtfs, 1905 SDslu, 701 SDs, 0 SdLazy, 1210 SolverSat, 1354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 508 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15633 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=10, InterpolantAutomatonStates: 339, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 380 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 384 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 1595 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1074 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 9/1965 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 01:59:01,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c8d45b1-4657-4a28-926a-5bd5fd8c527c/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE