./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longer-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan --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 22a6d794ae7d6ac1007b3e6bed733f083c296e3e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 20:01:31,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 20:01:31,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 20:01:31,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 20:01:31,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 20:01:31,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 20:01:31,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 20:01:31,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 20:01:31,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 20:01:31,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 20:01:31,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 20:01:31,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 20:01:31,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 20:01:31,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 20:01:31,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 20:01:31,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 20:01:31,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 20:01:31,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 20:01:31,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 20:01:31,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 20:01:31,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 20:01:31,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 20:01:31,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 20:01:31,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 20:01:31,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 20:01:31,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 20:01:31,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 20:01:31,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 20:01:31,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 20:01:31,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 20:01:31,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 20:01:31,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 20:01:31,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 20:01:31,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 20:01:31,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 20:01:31,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 20:01:31,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 20:01:31,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 20:01:31,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 20:01:31,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 20:01:31,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 20:01:31,237 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 20:01:31,261 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 20:01:31,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 20:01:31,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 20:01:31,262 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 20:01:31,262 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 20:01:31,262 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 20:01:31,263 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 20:01:31,263 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 20:01:31,263 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 20:01:31,263 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 20:01:31,263 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 20:01:31,263 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 20:01:31,264 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 20:01:31,264 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 20:01:31,264 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 20:01:31,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 20:01:31,265 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 20:01:31,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 20:01:31,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 20:01:31,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 20:01:31,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 20:01:31,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 20:01:31,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 20:01:31,266 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 20:01:31,266 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 20:01:31,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 20:01:31,267 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 20:01:31,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 20:01:31,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 20:01:31,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 20:01:31,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:01:31,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 20:01:31,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 20:01:31,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 20:01:31,268 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 20:01:31,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 20:01:31,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 20:01:31,269 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 20:01:31,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 20:01:31,269 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-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/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-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan 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 -> 22a6d794ae7d6ac1007b3e6bed733f083c296e3e [2020-12-09 20:01:31,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 20:01:31,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 20:01:31,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 20:01:31,454 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 20:01:31,454 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 20:01:31,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longer-1.i [2020-12-09 20:01:31,500 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/data/a1f730ab7/313a00575cd1470089a0dc89f1892b13/FLAG0cc0a488f [2020-12-09 20:01:31,923 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 20:01:31,924 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/sv-benchmarks/c/pthread/triangular-longer-1.i [2020-12-09 20:01:31,934 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/data/a1f730ab7/313a00575cd1470089a0dc89f1892b13/FLAG0cc0a488f [2020-12-09 20:01:31,947 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/data/a1f730ab7/313a00575cd1470089a0dc89f1892b13 [2020-12-09 20:01:31,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 20:01:31,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 20:01:31,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 20:01:31,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 20:01:31,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 20:01:31,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:01:31" (1/1) ... [2020-12-09 20:01:31,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259c37e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:31, skipping insertion in model container [2020-12-09 20:01:31,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:01:31" (1/1) ... [2020-12-09 20:01:31,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 20:01:31,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 20:01:32,194 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/sv-benchmarks/c/pthread/triangular-longer-1.i[30961,30974] [2020-12-09 20:01:32,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:01:32,202 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 20:01:32,230 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/sv-benchmarks/c/pthread/triangular-longer-1.i[30961,30974] [2020-12-09 20:01:32,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:01:32,279 INFO L208 MainTranslator]: Completed translation [2020-12-09 20:01:32,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32 WrapperNode [2020-12-09 20:01:32,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 20:01:32,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 20:01:32,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 20:01:32,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 20:01:32,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... [2020-12-09 20:01:32,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... [2020-12-09 20:01:32,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 20:01:32,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 20:01:32,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 20:01:32,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 20:01:32,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... [2020-12-09 20:01:32,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... [2020-12-09 20:01:32,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... [2020-12-09 20:01:32,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... [2020-12-09 20:01:32,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... [2020-12-09 20:01:32,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... [2020-12-09 20:01:32,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... [2020-12-09 20:01:32,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 20:01:32,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 20:01:32,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 20:01:32,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 20:01:32,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:01:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-12-09 20:01:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-12-09 20:01:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-12-09 20:01:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-12-09 20:01:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 20:01:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 20:01:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 20:01:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 20:01:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 20:01:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 20:01:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 20:01:32,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 20:01:32,408 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 20:01:32,609 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 20:01:32,609 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-09 20:01:32,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:01:32 BoogieIcfgContainer [2020-12-09 20:01:32,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 20:01:32,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 20:01:32,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 20:01:32,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 20:01:32,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:01:31" (1/3) ... [2020-12-09 20:01:32,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f69ee79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:01:32, skipping insertion in model container [2020-12-09 20:01:32,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:32" (2/3) ... [2020-12-09 20:01:32,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f69ee79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:01:32, skipping insertion in model container [2020-12-09 20:01:32,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:01:32" (3/3) ... [2020-12-09 20:01:32,616 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longer-1.i [2020-12-09 20:01:32,625 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 20:01:32,625 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 20:01:32,627 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 20:01:32,628 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 20:01:32,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,647 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,647 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,647 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,649 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,649 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,650 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,650 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,650 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,651 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,651 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,651 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,651 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,651 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,651 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,651 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,651 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,651 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,652 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,652 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,652 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,652 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,652 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,652 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,652 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,652 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,653 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,653 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,653 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,653 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,653 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,653 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,653 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,653 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,654 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,654 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,655 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,655 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,655 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,659 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,660 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,660 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,660 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,660 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,660 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:01:32,661 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 20:01:32,669 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-12-09 20:01:32,683 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 20:01:32,683 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 20:01:32,683 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 20:01:32,683 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 20:01:32,683 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 20:01:32,684 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 20:01:32,684 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 20:01:32,684 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 20:01:32,691 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 20:01:32,693 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 130 flow [2020-12-09 20:01:32,695 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 130 flow [2020-12-09 20:01:32,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 130 flow [2020-12-09 20:01:32,721 INFO L129 PetriNetUnfolder]: 5/58 cut-off events. [2020-12-09 20:01:32,722 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 20:01:32,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 58 events. 5/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2020-12-09 20:01:32,727 INFO L116 LiptonReduction]: Number of co-enabled transitions 968 [2020-12-09 20:01:34,290 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-09 20:01:34,541 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-09 20:01:34,625 INFO L131 LiptonReduction]: Checked pairs total: 998 [2020-12-09 20:01:34,625 INFO L133 LiptonReduction]: Total number of compositions: 52 [2020-12-09 20:01:34,629 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-12-09 20:01:34,635 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-12-09 20:01:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-12-09 20:01:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 20:01:34,639 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:34,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 20:01:34,640 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:34,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1332860337, now seen corresponding path program 1 times [2020-12-09 20:01:34,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:34,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064191563] [2020-12-09 20:01:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:34,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064191563] [2020-12-09 20:01:34,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:01:34,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 20:01:34,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886636375] [2020-12-09 20:01:34,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:01:34,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:01:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:01:34,806 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-12-09 20:01:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:34,841 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2020-12-09 20:01:34,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 20:01:34,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 20:01:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:34,853 INFO L225 Difference]: With dead ends: 59 [2020-12-09 20:01:34,853 INFO L226 Difference]: Without dead ends: 38 [2020-12-09 20:01:34,854 INFO L677 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 [2020-12-09 20:01:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-09 20:01:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-09 20:01:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 20:01:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2020-12-09 20:01:34,880 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 92 transitions. Word has length 6 [2020-12-09 20:01:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:34,880 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 92 transitions. [2020-12-09 20:01:34,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:01:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 92 transitions. [2020-12-09 20:01:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:01:34,881 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:34,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:34,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 20:01:34,881 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:34,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:34,882 INFO L82 PathProgramCache]: Analyzing trace with hash -978539367, now seen corresponding path program 1 times [2020-12-09 20:01:34,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:34,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156424741] [2020-12-09 20:01:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:34,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156424741] [2020-12-09 20:01:34,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:01:34,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:01:34,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682412169] [2020-12-09 20:01:34,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:01:34,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:01:34,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:01:34,964 INFO L87 Difference]: Start difference. First operand 38 states and 92 transitions. Second operand 5 states. [2020-12-09 20:01:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:35,001 INFO L93 Difference]: Finished difference Result 82 states and 192 transitions. [2020-12-09 20:01:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 20:01:35,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 20:01:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:35,003 INFO L225 Difference]: With dead ends: 82 [2020-12-09 20:01:35,003 INFO L226 Difference]: Without dead ends: 74 [2020-12-09 20:01:35,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:01:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-09 20:01:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2020-12-09 20:01:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 20:01:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 129 transitions. [2020-12-09 20:01:35,014 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 129 transitions. Word has length 8 [2020-12-09 20:01:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:35,015 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 129 transitions. [2020-12-09 20:01:35,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:01:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 129 transitions. [2020-12-09 20:01:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:01:35,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:35,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:35,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 20:01:35,016 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash -978459387, now seen corresponding path program 2 times [2020-12-09 20:01:35,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:35,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630745880] [2020-12-09 20:01:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:35,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630745880] [2020-12-09 20:01:35,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:01:35,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:01:35,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791347064] [2020-12-09 20:01:35,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:01:35,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:35,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:01:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:01:35,080 INFO L87 Difference]: Start difference. First operand 52 states and 129 transitions. Second operand 5 states. [2020-12-09 20:01:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:35,134 INFO L93 Difference]: Finished difference Result 70 states and 163 transitions. [2020-12-09 20:01:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:01:35,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 20:01:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:35,135 INFO L225 Difference]: With dead ends: 70 [2020-12-09 20:01:35,135 INFO L226 Difference]: Without dead ends: 54 [2020-12-09 20:01:35,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 20:01:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-09 20:01:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2020-12-09 20:01:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 20:01:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2020-12-09 20:01:35,140 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 90 transitions. Word has length 8 [2020-12-09 20:01:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:35,140 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 90 transitions. [2020-12-09 20:01:35,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:01:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 90 transitions. [2020-12-09 20:01:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:01:35,141 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:35,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:35,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 20:01:35,141 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 220478720, now seen corresponding path program 1 times [2020-12-09 20:01:35,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:35,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937801661] [2020-12-09 20:01:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:35,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937801661] [2020-12-09 20:01:35,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:01:35,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:01:35,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295547107] [2020-12-09 20:01:35,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:01:35,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:35,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:01:35,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:01:35,203 INFO L87 Difference]: Start difference. First operand 38 states and 90 transitions. Second operand 6 states. [2020-12-09 20:01:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:35,244 INFO L93 Difference]: Finished difference Result 58 states and 134 transitions. [2020-12-09 20:01:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:01:35,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:01:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:35,245 INFO L225 Difference]: With dead ends: 58 [2020-12-09 20:01:35,245 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 20:01:35,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 20:01:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 20:01:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2020-12-09 20:01:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-12-09 20:01:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 107 transitions. [2020-12-09 20:01:35,250 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 107 transitions. Word has length 10 [2020-12-09 20:01:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:35,250 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 107 transitions. [2020-12-09 20:01:35,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:01:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 107 transitions. [2020-12-09 20:01:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:01:35,251 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:35,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:35,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 20:01:35,251 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash 266866190, now seen corresponding path program 2 times [2020-12-09 20:01:35,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:35,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106529101] [2020-12-09 20:01:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:35,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106529101] [2020-12-09 20:01:35,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:01:35,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:01:35,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947421105] [2020-12-09 20:01:35,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:01:35,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:35,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:01:35,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:01:35,304 INFO L87 Difference]: Start difference. First operand 44 states and 107 transitions. Second operand 6 states. [2020-12-09 20:01:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:35,344 INFO L93 Difference]: Finished difference Result 78 states and 182 transitions. [2020-12-09 20:01:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 20:01:35,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:01:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:35,345 INFO L225 Difference]: With dead ends: 78 [2020-12-09 20:01:35,345 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 20:01:35,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 20:01:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 20:01:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-12-09 20:01:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 20:01:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 115 transitions. [2020-12-09 20:01:35,351 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 115 transitions. Word has length 10 [2020-12-09 20:01:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:35,351 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 115 transitions. [2020-12-09 20:01:35,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:01:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 115 transitions. [2020-12-09 20:01:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:01:35,352 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:35,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:35,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 20:01:35,353 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:35,353 INFO L82 PathProgramCache]: Analyzing trace with hash 266888510, now seen corresponding path program 3 times [2020-12-09 20:01:35,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:35,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046265937] [2020-12-09 20:01:35,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:35,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046265937] [2020-12-09 20:01:35,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:01:35,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:01:35,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266910051] [2020-12-09 20:01:35,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:01:35,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:35,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:01:35,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:01:35,411 INFO L87 Difference]: Start difference. First operand 46 states and 115 transitions. Second operand 6 states. [2020-12-09 20:01:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:35,470 INFO L93 Difference]: Finished difference Result 56 states and 131 transitions. [2020-12-09 20:01:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:01:35,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:01:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:35,471 INFO L225 Difference]: With dead ends: 56 [2020-12-09 20:01:35,471 INFO L226 Difference]: Without dead ends: 45 [2020-12-09 20:01:35,471 INFO L677 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 [2020-12-09 20:01:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-09 20:01:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2020-12-09 20:01:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-09 20:01:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2020-12-09 20:01:35,474 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 10 [2020-12-09 20:01:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:35,474 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2020-12-09 20:01:35,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:01:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2020-12-09 20:01:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 20:01:35,475 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:35,475 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:35,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 20:01:35,475 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1755209235, now seen corresponding path program 4 times [2020-12-09 20:01:35,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:35,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896027752] [2020-12-09 20:01:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:35,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896027752] [2020-12-09 20:01:35,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33195929] [2020-12-09 20:01:35,524 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:35,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 20:01:35,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:35,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:35,624 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:35,624 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:35,631 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:35,649 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:35,667 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:35,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [69036033] [2020-12-09 20:01:35,699 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:35,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:35,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2020-12-09 20:01:35,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033542971] [2020-12-09 20:01:35,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 20:01:35,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:35,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 20:01:35,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-09 20:01:35,701 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand 12 states. [2020-12-09 20:01:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:35,797 INFO L93 Difference]: Finished difference Result 71 states and 159 transitions. [2020-12-09 20:01:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 20:01:35,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-12-09 20:01:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:35,798 INFO L225 Difference]: With dead ends: 71 [2020-12-09 20:01:35,798 INFO L226 Difference]: Without dead ends: 53 [2020-12-09 20:01:35,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2020-12-09 20:01:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-09 20:01:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2020-12-09 20:01:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 20:01:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 115 transitions. [2020-12-09 20:01:35,803 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 115 transitions. Word has length 11 [2020-12-09 20:01:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:35,803 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 115 transitions. [2020-12-09 20:01:35,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 20:01:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 115 transitions. [2020-12-09 20:01:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 20:01:35,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:35,804 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:36,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-09 20:01:36,004 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:36,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:36,005 INFO L82 PathProgramCache]: Analyzing trace with hash -316364261, now seen corresponding path program 5 times [2020-12-09 20:01:36,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:36,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139957369] [2020-12-09 20:01:36,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:36,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139957369] [2020-12-09 20:01:36,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146112660] [2020-12-09 20:01:36,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:36,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 20:01:36,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:36,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 20:01:36,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:36,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:01:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:36,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:36,122 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:36,122 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:36,139 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:36,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [996853359] [2020-12-09 20:01:36,170 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:36,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:36,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2020-12-09 20:01:36,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271033918] [2020-12-09 20:01:36,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 20:01:36,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:36,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 20:01:36,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-09 20:01:36,172 INFO L87 Difference]: Start difference. First operand 49 states and 115 transitions. Second operand 13 states. [2020-12-09 20:01:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:36,342 INFO L93 Difference]: Finished difference Result 89 states and 211 transitions. [2020-12-09 20:01:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 20:01:36,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-12-09 20:01:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:36,343 INFO L225 Difference]: With dead ends: 89 [2020-12-09 20:01:36,343 INFO L226 Difference]: Without dead ends: 64 [2020-12-09 20:01:36,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-09 20:01:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2020-12-09 20:01:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-09 20:01:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 128 transitions. [2020-12-09 20:01:36,349 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 128 transitions. Word has length 11 [2020-12-09 20:01:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:36,349 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 128 transitions. [2020-12-09 20:01:36,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 20:01:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 128 transitions. [2020-12-09 20:01:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 20:01:36,350 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:36,350 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:36,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:36,551 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:36,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:36,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1554804726, now seen corresponding path program 6 times [2020-12-09 20:01:36,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:36,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999631248] [2020-12-09 20:01:36,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:36,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999631248] [2020-12-09 20:01:36,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016530498] [2020-12-09 20:01:36,718 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:36,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:01:36,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:36,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 20:01:36,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:36,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:36,794 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:36,794 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:36,806 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:36,820 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:36,835 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:36,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1917669475] [2020-12-09 20:01:36,875 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:36,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:36,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-12-09 20:01:36,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515440872] [2020-12-09 20:01:36,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 20:01:36,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 20:01:36,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-12-09 20:01:36,876 INFO L87 Difference]: Start difference. First operand 54 states and 128 transitions. Second operand 16 states. [2020-12-09 20:01:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:37,115 INFO L93 Difference]: Finished difference Result 148 states and 331 transitions. [2020-12-09 20:01:37,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-09 20:01:37,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-12-09 20:01:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:37,116 INFO L225 Difference]: With dead ends: 148 [2020-12-09 20:01:37,116 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 20:01:37,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 20:01:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 20:01:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2020-12-09 20:01:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-09 20:01:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 171 transitions. [2020-12-09 20:01:37,121 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 171 transitions. Word has length 14 [2020-12-09 20:01:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:37,122 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 171 transitions. [2020-12-09 20:01:37,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 20:01:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 171 transitions. [2020-12-09 20:01:37,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 20:01:37,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:37,123 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:37,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:37,325 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:37,326 INFO L82 PathProgramCache]: Analyzing trace with hash -867590526, now seen corresponding path program 7 times [2020-12-09 20:01:37,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:37,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720540986] [2020-12-09 20:01:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:37,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720540986] [2020-12-09 20:01:37,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255000163] [2020-12-09 20:01:37,488 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:37,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 20:01:37,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:37,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:37,564 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:37,564 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:37,570 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:37,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1478932922] [2020-12-09 20:01:37,623 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:37,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:37,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-12-09 20:01:37,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163264154] [2020-12-09 20:01:37,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 20:01:37,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:37,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 20:01:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-12-09 20:01:37,625 INFO L87 Difference]: Start difference. First operand 69 states and 171 transitions. Second operand 16 states. [2020-12-09 20:01:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:37,960 INFO L93 Difference]: Finished difference Result 153 states and 367 transitions. [2020-12-09 20:01:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 20:01:37,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-12-09 20:01:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:37,962 INFO L225 Difference]: With dead ends: 153 [2020-12-09 20:01:37,962 INFO L226 Difference]: Without dead ends: 105 [2020-12-09 20:01:37,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=452, Invalid=954, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 20:01:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-12-09 20:01:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2020-12-09 20:01:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 20:01:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2020-12-09 20:01:37,966 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2020-12-09 20:01:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:37,966 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2020-12-09 20:01:37,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 20:01:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2020-12-09 20:01:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 20:01:37,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:37,967 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:38,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:38,169 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash -695615729, now seen corresponding path program 8 times [2020-12-09 20:01:38,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:38,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872823131] [2020-12-09 20:01:38,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:38,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872823131] [2020-12-09 20:01:38,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772678946] [2020-12-09 20:01:38,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:38,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-12-09 20:01:38,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:38,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 20:01:38,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:38,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:38,376 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:38,377 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:38,390 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:38,404 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:38,418 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:38,432 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:38,448 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:38,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [75677826] [2020-12-09 20:01:38,515 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:38,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:38,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2020-12-09 20:01:38,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933915422] [2020-12-09 20:01:38,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 20:01:38,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:38,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 20:01:38,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2020-12-09 20:01:38,516 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand 22 states. [2020-12-09 20:01:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:38,867 INFO L93 Difference]: Finished difference Result 209 states and 472 transitions. [2020-12-09 20:01:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-09 20:01:38,867 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2020-12-09 20:01:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:38,868 INFO L225 Difference]: With dead ends: 209 [2020-12-09 20:01:38,868 INFO L226 Difference]: Without dead ends: 172 [2020-12-09 20:01:38,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=599, Invalid=1563, Unknown=0, NotChecked=0, Total=2162 [2020-12-09 20:01:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-09 20:01:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 83. [2020-12-09 20:01:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-12-09 20:01:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 212 transitions. [2020-12-09 20:01:38,874 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 212 transitions. Word has length 17 [2020-12-09 20:01:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:38,874 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 212 transitions. [2020-12-09 20:01:38,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 20:01:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 212 transitions. [2020-12-09 20:01:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 20:01:38,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:38,875 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:39,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-09 20:01:39,076 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash -759426769, now seen corresponding path program 9 times [2020-12-09 20:01:39,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:39,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032169603] [2020-12-09 20:01:39,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:39,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032169603] [2020-12-09 20:01:39,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281631001] [2020-12-09 20:01:39,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:39,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:01:39,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:39,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 20:01:39,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:39,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:39,249 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:39,249 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:39,268 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:01:39,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [210013218] [2020-12-09 20:01:39,359 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:39,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:39,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2020-12-09 20:01:39,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442182432] [2020-12-09 20:01:39,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 20:01:39,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 20:01:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2020-12-09 20:01:39,361 INFO L87 Difference]: Start difference. First operand 83 states and 212 transitions. Second operand 23 states. [2020-12-09 20:01:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:39,893 INFO L93 Difference]: Finished difference Result 177 states and 429 transitions. [2020-12-09 20:01:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-09 20:01:39,893 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 17 [2020-12-09 20:01:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:39,894 INFO L225 Difference]: With dead ends: 177 [2020-12-09 20:01:39,894 INFO L226 Difference]: Without dead ends: 115 [2020-12-09 20:01:39,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=964, Invalid=2116, Unknown=0, NotChecked=0, Total=3080 [2020-12-09 20:01:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-09 20:01:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 61. [2020-12-09 20:01:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 20:01:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 148 transitions. [2020-12-09 20:01:39,898 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 148 transitions. Word has length 17 [2020-12-09 20:01:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:39,898 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 148 transitions. [2020-12-09 20:01:39,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 20:01:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 148 transitions. [2020-12-09 20:01:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 20:01:39,899 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:39,899 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:40,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:40,101 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:40,102 INFO L82 PathProgramCache]: Analyzing trace with hash -670224702, now seen corresponding path program 10 times [2020-12-09 20:01:40,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:40,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999542259] [2020-12-09 20:01:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:40,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999542259] [2020-12-09 20:01:40,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345362976] [2020-12-09 20:01:40,266 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:40,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 20:01:40,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:40,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:01:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:40,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:40,363 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:40,363 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:40,366 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:40,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1699853056] [2020-12-09 20:01:40,569 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:40,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:40,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2020-12-09 20:01:40,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388327403] [2020-12-09 20:01:40,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-09 20:01:40,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:40,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-09 20:01:40,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1078, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 20:01:40,571 INFO L87 Difference]: Start difference. First operand 61 states and 148 transitions. Second operand 38 states. [2020-12-09 20:01:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:41,394 INFO L93 Difference]: Finished difference Result 156 states and 383 transitions. [2020-12-09 20:01:41,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-12-09 20:01:41,394 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 24 [2020-12-09 20:01:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:41,396 INFO L225 Difference]: With dead ends: 156 [2020-12-09 20:01:41,396 INFO L226 Difference]: Without dead ends: 112 [2020-12-09 20:01:41,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2072, Invalid=4734, Unknown=0, NotChecked=0, Total=6806 [2020-12-09 20:01:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-09 20:01:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2020-12-09 20:01:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-09 20:01:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 191 transitions. [2020-12-09 20:01:41,402 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 191 transitions. Word has length 24 [2020-12-09 20:01:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:41,402 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 191 transitions. [2020-12-09 20:01:41,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-09 20:01:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 191 transitions. [2020-12-09 20:01:41,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:41,403 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:41,403 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:41,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:41,604 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:41,605 INFO L82 PathProgramCache]: Analyzing trace with hash 780243396, now seen corresponding path program 11 times [2020-12-09 20:01:41,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:41,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854046863] [2020-12-09 20:01:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:41,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854046863] [2020-12-09 20:01:41,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393715551] [2020-12-09 20:01:41,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:41,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-12-09 20:01:41,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:41,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 20:01:41,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:41,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:41,948 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:41,948 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,951 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,953 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,956 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,958 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,960 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,963 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,965 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,967 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,969 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,971 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,974 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,976 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,978 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,980 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,982 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,985 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,987 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,989 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,991 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:41,994 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:42,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1623161162] [2020-12-09 20:01:42,000 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:42,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:42,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 23 [2020-12-09 20:01:42,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868306664] [2020-12-09 20:01:42,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 20:01:42,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:42,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 20:01:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2020-12-09 20:01:42,002 INFO L87 Difference]: Start difference. First operand 78 states and 191 transitions. Second operand 25 states. [2020-12-09 20:01:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:42,369 INFO L93 Difference]: Finished difference Result 131 states and 298 transitions. [2020-12-09 20:01:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 20:01:42,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2020-12-09 20:01:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:42,370 INFO L225 Difference]: With dead ends: 131 [2020-12-09 20:01:42,370 INFO L226 Difference]: Without dead ends: 125 [2020-12-09 20:01:42,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=670, Invalid=1492, Unknown=0, NotChecked=0, Total=2162 [2020-12-09 20:01:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-09 20:01:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2020-12-09 20:01:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 20:01:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 194 transitions. [2020-12-09 20:01:42,374 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 194 transitions. Word has length 28 [2020-12-09 20:01:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:42,374 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 194 transitions. [2020-12-09 20:01:42,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 20:01:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 194 transitions. [2020-12-09 20:01:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:42,375 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:42,375 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:42,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-09 20:01:42,577 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2141485906, now seen corresponding path program 12 times [2020-12-09 20:01:42,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:42,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87125701] [2020-12-09 20:01:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:42,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87125701] [2020-12-09 20:01:42,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192782844] [2020-12-09 20:01:42,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:42,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:01:42,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:42,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:42,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:42,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:42,917 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:42,917 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,920 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,923 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,926 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,929 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,931 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,934 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,937 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,940 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,943 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,946 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,948 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,950 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,952 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,954 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,956 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,958 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,960 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,962 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,964 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:42,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [865819431] [2020-12-09 20:01:42,971 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:42,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:42,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:42,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955568114] [2020-12-09 20:01:42,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:42,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:42,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:42,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:42,972 INFO L87 Difference]: Start difference. First operand 79 states and 194 transitions. Second operand 24 states. [2020-12-09 20:01:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:43,279 INFO L93 Difference]: Finished difference Result 153 states and 343 transitions. [2020-12-09 20:01:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 20:01:43,279 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:43,280 INFO L225 Difference]: With dead ends: 153 [2020-12-09 20:01:43,280 INFO L226 Difference]: Without dead ends: 147 [2020-12-09 20:01:43,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=603, Invalid=1377, Unknown=0, NotChecked=0, Total=1980 [2020-12-09 20:01:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-12-09 20:01:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 79. [2020-12-09 20:01:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 20:01:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 195 transitions. [2020-12-09 20:01:43,284 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 195 transitions. Word has length 28 [2020-12-09 20:01:43,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:43,284 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 195 transitions. [2020-12-09 20:01:43,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 195 transitions. [2020-12-09 20:01:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:43,285 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:43,285 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:43,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-09 20:01:43,487 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:43,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:43,488 INFO L82 PathProgramCache]: Analyzing trace with hash -840947766, now seen corresponding path program 13 times [2020-12-09 20:01:43,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:43,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403076744] [2020-12-09 20:01:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:43,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403076744] [2020-12-09 20:01:43,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526174609] [2020-12-09 20:01:43,704 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:43,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:43,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:43,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:43,782 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:43,782 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,785 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,788 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,791 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,793 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,796 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,799 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,803 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,809 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,812 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,815 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,819 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,821 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,823 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,825 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,828 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,830 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,833 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:43,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1334609948] [2020-12-09 20:01:43,843 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:43,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:43,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:43,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679940702] [2020-12-09 20:01:43,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:43,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:43,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:43,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:43,845 INFO L87 Difference]: Start difference. First operand 79 states and 195 transitions. Second operand 24 states. [2020-12-09 20:01:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:44,178 INFO L93 Difference]: Finished difference Result 150 states and 339 transitions. [2020-12-09 20:01:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 20:01:44,179 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:44,180 INFO L225 Difference]: With dead ends: 150 [2020-12-09 20:01:44,180 INFO L226 Difference]: Without dead ends: 144 [2020-12-09 20:01:44,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=608, Invalid=1554, Unknown=0, NotChecked=0, Total=2162 [2020-12-09 20:01:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-09 20:01:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 81. [2020-12-09 20:01:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-09 20:01:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 201 transitions. [2020-12-09 20:01:44,183 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 201 transitions. Word has length 28 [2020-12-09 20:01:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:44,184 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 201 transitions. [2020-12-09 20:01:44,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 201 transitions. [2020-12-09 20:01:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:44,184 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:44,184 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:44,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-09 20:01:44,386 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1435275842, now seen corresponding path program 14 times [2020-12-09 20:01:44,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:44,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796633265] [2020-12-09 20:01:44,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:44,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796633265] [2020-12-09 20:01:44,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650624684] [2020-12-09 20:01:44,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:44,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-12-09 20:01:44,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:44,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:44,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:44,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:44,708 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:44,708 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,711 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,713 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,715 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,717 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,719 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,721 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,723 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,726 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,728 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,730 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,732 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,734 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,736 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,738 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,740 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:44,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [221355993] [2020-12-09 20:01:44,752 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:44,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:44,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:44,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961045266] [2020-12-09 20:01:44,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:44,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:44,753 INFO L87 Difference]: Start difference. First operand 81 states and 201 transitions. Second operand 24 states. [2020-12-09 20:01:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:45,129 INFO L93 Difference]: Finished difference Result 148 states and 337 transitions. [2020-12-09 20:01:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-09 20:01:45,129 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:45,130 INFO L225 Difference]: With dead ends: 148 [2020-12-09 20:01:45,130 INFO L226 Difference]: Without dead ends: 142 [2020-12-09 20:01:45,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1723, Unknown=0, NotChecked=0, Total=2352 [2020-12-09 20:01:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-09 20:01:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 83. [2020-12-09 20:01:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-12-09 20:01:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 207 transitions. [2020-12-09 20:01:45,133 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 207 transitions. Word has length 28 [2020-12-09 20:01:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:45,133 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 207 transitions. [2020-12-09 20:01:45,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 207 transitions. [2020-12-09 20:01:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:45,134 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:45,134 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:45,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-09 20:01:45,335 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:45,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1748944198, now seen corresponding path program 15 times [2020-12-09 20:01:45,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:45,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801724548] [2020-12-09 20:01:45,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:45,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801724548] [2020-12-09 20:01:45,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264159740] [2020-12-09 20:01:45,562 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:45,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:01:45,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:45,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:45,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:45,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:45,633 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:45,633 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,635 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,637 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,639 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,641 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,643 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,645 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,647 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,649 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,652 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,654 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,656 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,658 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,660 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:45,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1728728286] [2020-12-09 20:01:45,674 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:45,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:45,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:45,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548000865] [2020-12-09 20:01:45,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:45,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:45,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:45,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:45,676 INFO L87 Difference]: Start difference. First operand 83 states and 207 transitions. Second operand 24 states. [2020-12-09 20:01:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:46,098 INFO L93 Difference]: Finished difference Result 146 states and 335 transitions. [2020-12-09 20:01:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-09 20:01:46,099 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:46,100 INFO L225 Difference]: With dead ends: 146 [2020-12-09 20:01:46,100 INFO L226 Difference]: Without dead ends: 140 [2020-12-09 20:01:46,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=1884, Unknown=0, NotChecked=0, Total=2550 [2020-12-09 20:01:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-12-09 20:01:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 85. [2020-12-09 20:01:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-09 20:01:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 213 transitions. [2020-12-09 20:01:46,103 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 213 transitions. Word has length 28 [2020-12-09 20:01:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:46,103 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 213 transitions. [2020-12-09 20:01:46,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 213 transitions. [2020-12-09 20:01:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:46,104 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:46,104 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:46,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-09 20:01:46,304 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:46,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1970643250, now seen corresponding path program 16 times [2020-12-09 20:01:46,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:46,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959357124] [2020-12-09 20:01:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:46,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959357124] [2020-12-09 20:01:46,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954734612] [2020-12-09 20:01:46,481 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:46,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:46,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:46,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:46,553 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:46,553 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,556 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,558 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,560 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,562 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,564 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,566 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,568 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,570 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,572 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,574 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,576 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:46,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1443678102] [2020-12-09 20:01:46,593 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:46,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:46,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:46,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304522690] [2020-12-09 20:01:46,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:46,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:46,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:46,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:46,595 INFO L87 Difference]: Start difference. First operand 85 states and 213 transitions. Second operand 24 states. [2020-12-09 20:01:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:46,999 INFO L93 Difference]: Finished difference Result 144 states and 333 transitions. [2020-12-09 20:01:46,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-09 20:01:46,999 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:47,000 INFO L225 Difference]: With dead ends: 144 [2020-12-09 20:01:47,000 INFO L226 Difference]: Without dead ends: 138 [2020-12-09 20:01:47,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=719, Invalid=2037, Unknown=0, NotChecked=0, Total=2756 [2020-12-09 20:01:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-12-09 20:01:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2020-12-09 20:01:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-09 20:01:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 219 transitions. [2020-12-09 20:01:47,003 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 219 transitions. Word has length 28 [2020-12-09 20:01:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:47,004 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 219 transitions. [2020-12-09 20:01:47,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 219 transitions. [2020-12-09 20:01:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:47,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:47,004 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:47,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:47,205 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1484700246, now seen corresponding path program 17 times [2020-12-09 20:01:47,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:47,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797946136] [2020-12-09 20:01:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:47,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797946136] [2020-12-09 20:01:47,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865420864] [2020-12-09 20:01:47,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:47,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-12-09 20:01:47,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:47,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:47,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:47,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:47,489 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:47,489 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,491 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,493 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,495 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,497 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,499 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,501 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,503 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,505 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,507 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:47,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [699012983] [2020-12-09 20:01:47,524 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:47,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:47,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:47,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626307558] [2020-12-09 20:01:47,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:47,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:47,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:47,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:47,526 INFO L87 Difference]: Start difference. First operand 87 states and 219 transitions. Second operand 24 states. [2020-12-09 20:01:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:48,003 INFO L93 Difference]: Finished difference Result 142 states and 331 transitions. [2020-12-09 20:01:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-12-09 20:01:48,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:48,004 INFO L225 Difference]: With dead ends: 142 [2020-12-09 20:01:48,004 INFO L226 Difference]: Without dead ends: 136 [2020-12-09 20:01:48,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=788, Invalid=2182, Unknown=0, NotChecked=0, Total=2970 [2020-12-09 20:01:48,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-12-09 20:01:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 89. [2020-12-09 20:01:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-12-09 20:01:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 225 transitions. [2020-12-09 20:01:48,007 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 225 transitions. Word has length 28 [2020-12-09 20:01:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:48,007 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 225 transitions. [2020-12-09 20:01:48,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 225 transitions. [2020-12-09 20:01:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:48,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:48,008 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:48,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:48,209 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash 916170786, now seen corresponding path program 18 times [2020-12-09 20:01:48,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:48,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175670628] [2020-12-09 20:01:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:48,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175670628] [2020-12-09 20:01:48,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934215908] [2020-12-09 20:01:48,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:48,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:01:48,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:48,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:48,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:48,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:48,467 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:48,467 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:48,469 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:48,471 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:48,473 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:48,475 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:48,476 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:48,478 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:48,480 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:48,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1209952021] [2020-12-09 20:01:48,499 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:48,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:48,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:48,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962008130] [2020-12-09 20:01:48,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:48,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:48,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:48,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:48,500 INFO L87 Difference]: Start difference. First operand 89 states and 225 transitions. Second operand 24 states. [2020-12-09 20:01:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:49,052 INFO L93 Difference]: Finished difference Result 140 states and 329 transitions. [2020-12-09 20:01:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-09 20:01:49,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:49,053 INFO L225 Difference]: With dead ends: 140 [2020-12-09 20:01:49,054 INFO L226 Difference]: Without dead ends: 134 [2020-12-09 20:01:49,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=873, Invalid=2319, Unknown=0, NotChecked=0, Total=3192 [2020-12-09 20:01:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-12-09 20:01:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 91. [2020-12-09 20:01:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-09 20:01:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-12-09 20:01:49,057 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 28 [2020-12-09 20:01:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:49,057 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-12-09 20:01:49,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-12-09 20:01:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:49,058 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:49,058 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:49,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-09 20:01:49,259 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash -212055910, now seen corresponding path program 19 times [2020-12-09 20:01:49,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:49,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292739656] [2020-12-09 20:01:49,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:49,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292739656] [2020-12-09 20:01:49,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5477971] [2020-12-09 20:01:49,430 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:49,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:49,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:49,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:49,494 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:49,494 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:49,496 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:49,497 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:49,499 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:49,501 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:49,502 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:49,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1462516223] [2020-12-09 20:01:49,523 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:49,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:49,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:49,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077631930] [2020-12-09 20:01:49,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:49,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:49,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:49,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:49,525 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 24 states. [2020-12-09 20:01:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:50,072 INFO L93 Difference]: Finished difference Result 138 states and 327 transitions. [2020-12-09 20:01:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-12-09 20:01:50,072 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:50,073 INFO L225 Difference]: With dead ends: 138 [2020-12-09 20:01:50,073 INFO L226 Difference]: Without dead ends: 132 [2020-12-09 20:01:50,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=974, Invalid=2448, Unknown=0, NotChecked=0, Total=3422 [2020-12-09 20:01:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-09 20:01:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 93. [2020-12-09 20:01:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-12-09 20:01:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 237 transitions. [2020-12-09 20:01:50,076 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 237 transitions. Word has length 28 [2020-12-09 20:01:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:50,076 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 237 transitions. [2020-12-09 20:01:50,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 237 transitions. [2020-12-09 20:01:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:50,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:50,077 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:50,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:50,278 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash -298146030, now seen corresponding path program 20 times [2020-12-09 20:01:50,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:50,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522198498] [2020-12-09 20:01:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:50,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522198498] [2020-12-09 20:01:50,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901553566] [2020-12-09 20:01:50,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:50,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-12-09 20:01:50,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:50,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-09 20:01:50,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:50,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:50,521 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:50,522 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:50,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1876777804] [2020-12-09 20:01:50,549 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:50,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:50,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:50,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114813526] [2020-12-09 20:01:50,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:50,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:50,550 INFO L87 Difference]: Start difference. First operand 93 states and 237 transitions. Second operand 24 states. [2020-12-09 20:01:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:51,082 INFO L93 Difference]: Finished difference Result 136 states and 325 transitions. [2020-12-09 20:01:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-12-09 20:01:51,082 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:51,083 INFO L225 Difference]: With dead ends: 136 [2020-12-09 20:01:51,083 INFO L226 Difference]: Without dead ends: 130 [2020-12-09 20:01:51,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1091, Invalid=2569, Unknown=0, NotChecked=0, Total=3660 [2020-12-09 20:01:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-12-09 20:01:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2020-12-09 20:01:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-12-09 20:01:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 243 transitions. [2020-12-09 20:01:51,086 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 243 transitions. Word has length 28 [2020-12-09 20:01:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:51,087 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 243 transitions. [2020-12-09 20:01:51,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 243 transitions. [2020-12-09 20:01:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:51,087 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:51,087 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:51,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-09 20:01:51,288 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:51,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:51,289 INFO L82 PathProgramCache]: Analyzing trace with hash -275889270, now seen corresponding path program 21 times [2020-12-09 20:01:51,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:51,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696984033] [2020-12-09 20:01:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:51,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696984033] [2020-12-09 20:01:51,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962668775] [2020-12-09 20:01:51,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:51,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:01:51,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:51,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:51,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:51,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:51,550 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:51,550 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:51,554 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:51,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [784194260] [2020-12-09 20:01:51,581 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:51,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:51,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2020-12-09 20:01:51,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692402790] [2020-12-09 20:01:51,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 20:01:51,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:51,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 20:01:51,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:01:51,582 INFO L87 Difference]: Start difference. First operand 95 states and 243 transitions. Second operand 24 states. [2020-12-09 20:01:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:52,136 INFO L93 Difference]: Finished difference Result 153 states and 369 transitions. [2020-12-09 20:01:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-12-09 20:01:52,136 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2020-12-09 20:01:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:52,137 INFO L225 Difference]: With dead ends: 153 [2020-12-09 20:01:52,137 INFO L226 Difference]: Without dead ends: 147 [2020-12-09 20:01:52,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1224, Invalid=2682, Unknown=0, NotChecked=0, Total=3906 [2020-12-09 20:01:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-12-09 20:01:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 100. [2020-12-09 20:01:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-12-09 20:01:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 261 transitions. [2020-12-09 20:01:52,143 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 261 transitions. Word has length 28 [2020-12-09 20:01:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:52,143 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 261 transitions. [2020-12-09 20:01:52,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 20:01:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 261 transitions. [2020-12-09 20:01:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:01:52,144 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:52,144 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:52,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-12-09 20:01:52,345 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:52,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash -275866950, now seen corresponding path program 22 times [2020-12-09 20:01:52,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:52,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509029248] [2020-12-09 20:01:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:52,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509029248] [2020-12-09 20:01:52,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684158999] [2020-12-09 20:01:52,536 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:52,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 20:01:52,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:52,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:52,624 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:01:52,624 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:52,628 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:01:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:52,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1962787541] [2020-12-09 20:01:52,660 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:01:52,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:01:52,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 23 [2020-12-09 20:01:52,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718353085] [2020-12-09 20:01:52,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 20:01:52,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:52,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 20:01:52,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2020-12-09 20:01:52,662 INFO L87 Difference]: Start difference. First operand 100 states and 261 transitions. Second operand 25 states. [2020-12-09 20:01:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:53,396 INFO L93 Difference]: Finished difference Result 133 states and 323 transitions. [2020-12-09 20:01:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-12-09 20:01:53,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2020-12-09 20:01:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:53,397 INFO L225 Difference]: With dead ends: 133 [2020-12-09 20:01:53,397 INFO L226 Difference]: Without dead ends: 125 [2020-12-09 20:01:53,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1336, Invalid=2954, Unknown=0, NotChecked=0, Total=4290 [2020-12-09 20:01:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-09 20:01:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2020-12-09 20:01:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-12-09 20:01:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 249 transitions. [2020-12-09 20:01:53,401 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 249 transitions. Word has length 28 [2020-12-09 20:01:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:53,401 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 249 transitions. [2020-12-09 20:01:53,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 20:01:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 249 transitions. [2020-12-09 20:01:53,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 20:01:53,401 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:01:53,402 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:01:53,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-12-09 20:01:53,603 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:01:53,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:01:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash 38085663, now seen corresponding path program 23 times [2020-12-09 20:01:53,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:01:53,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713574307] [2020-12-09 20:01:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:01:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:01:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:53,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713574307] [2020-12-09 20:01:53,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121717160] [2020-12-09 20:01:53,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:01:53,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2020-12-09 20:01:53,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:01:53,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 20:01:53,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:01:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:53,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:01:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:01:53,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 20:01:53,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [13] total 14 [2020-12-09 20:01:53,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999842235] [2020-12-09 20:01:53,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 20:01:53,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:01:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 20:01:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-12-09 20:01:53,811 INFO L87 Difference]: Start difference. First operand 97 states and 249 transitions. Second operand 13 states. [2020-12-09 20:01:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:01:53,823 INFO L93 Difference]: Finished difference Result 387 states and 943 transitions. [2020-12-09 20:01:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 20:01:53,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2020-12-09 20:01:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:01:53,824 INFO L225 Difference]: With dead ends: 387 [2020-12-09 20:01:53,824 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 20:01:53,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-12-09 20:01:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 20:01:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 20:01:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 20:01:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 20:01:53,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-12-09 20:01:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:01:53,825 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 20:01:53,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 20:01:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 20:01:53,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 20:01:54,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-09 20:01:54,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:01:54 BasicIcfg [2020-12-09 20:01:54,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 20:01:54,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 20:01:54,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 20:01:54,028 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 20:01:54,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:01:32" (3/4) ... [2020-12-09 20:01:54,031 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 20:01:54,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2020-12-09 20:01:54,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2020-12-09 20:01:54,039 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2020-12-09 20:01:54,039 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 20:01:54,039 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 20:01:54,039 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 20:01:54,061 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8fd20122-8c18-408e-9063-9ff973d24733/bin/utaipan/witness.graphml [2020-12-09 20:01:54,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 20:01:54,062 INFO L168 Benchmark]: Toolchain (without parser) took 22111.37 ms. Allocated memory was 104.9 MB in the beginning and 188.7 MB in the end (delta: 83.9 MB). Free memory was 82.1 MB in the beginning and 63.8 MB in the end (delta: 18.3 MB). Peak memory consumption was 103.5 MB. Max. memory is 16.1 GB. [2020-12-09 20:01:54,062 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 71.3 MB. Free memory was 42.0 MB in the beginning and 41.9 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:01:54,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.27 ms. Allocated memory is still 104.9 MB. Free memory was 81.9 MB in the beginning and 52.9 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-12-09 20:01:54,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.87 ms. Allocated memory is still 104.9 MB. Free memory was 52.7 MB in the beginning and 51.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:01:54,063 INFO L168 Benchmark]: Boogie Preprocessor took 25.14 ms. Allocated memory is still 104.9 MB. Free memory was 51.0 MB in the beginning and 49.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:01:54,063 INFO L168 Benchmark]: RCFGBuilder took 266.93 ms. Allocated memory is still 104.9 MB. Free memory was 49.6 MB in the beginning and 66.9 MB in the end (delta: -17.3 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. [2020-12-09 20:01:54,063 INFO L168 Benchmark]: TraceAbstraction took 21416.30 ms. Allocated memory was 104.9 MB in the beginning and 188.7 MB in the end (delta: 83.9 MB). Free memory was 66.4 MB in the beginning and 65.9 MB in the end (delta: 545.8 kB). Peak memory consumption was 84.3 MB. Max. memory is 16.1 GB. [2020-12-09 20:01:54,064 INFO L168 Benchmark]: Witness Printer took 33.04 ms. Allocated memory is still 188.7 MB. Free memory was 65.9 MB in the beginning and 63.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:01:54,065 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.16 ms. Allocated memory is still 71.3 MB. Free memory was 42.0 MB in the beginning and 41.9 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 328.27 ms. Allocated memory is still 104.9 MB. Free memory was 81.9 MB in the beginning and 52.9 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.87 ms. Allocated memory is still 104.9 MB. Free memory was 52.7 MB in the beginning and 51.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.14 ms. Allocated memory is still 104.9 MB. Free memory was 51.0 MB in the beginning and 49.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 266.93 ms. Allocated memory is still 104.9 MB. Free memory was 49.6 MB in the beginning and 66.9 MB in the end (delta: -17.3 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21416.30 ms. Allocated memory was 104.9 MB in the beginning and 188.7 MB in the end (delta: 83.9 MB). Free memory was 66.4 MB in the beginning and 65.9 MB in the end (delta: 545.8 kB). Peak memory consumption was 84.3 MB. Max. memory is 16.1 GB. * Witness Printer took 33.04 ms. Allocated memory is still 188.7 MB. Free memory was 65.9 MB in the beginning and 63.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 645 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 20 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 20 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.9s, 62 PlacesBefore, 20 PlacesAfterwards, 60 TransitionsBefore, 16 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 52 TotalNumberOfCompositions, 998 MoverChecksTotal - PositiveResult [Line: 722]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.3s, OverallIterations: 26, TraceHistogramMax: 11, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 420 SDtfs, 2046 SDslu, 2430 SDs, 0 SdLazy, 2664 SolverSat, 1950 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1804 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 963 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12137 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=24, 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, 26 MinimizatonAttempts, 939 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 998 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 1405 ConstructedInterpolants, 0 QuantifiedInterpolants, 149983 SizeOfPredicates, 290 NumberOfNonLiveVariables, 3165 ConjunctsInSsa, 420 ConjunctsInUnsatCore, 66 InterpolantComputations, 8 PerfectInterpolantSequences, 302/3852 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 correct! Received shutdown request...