./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-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_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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 37b183961076d6fcb23260763ff12b2e8c94306b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:39:54,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 20:39:54,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 20:39:54,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 20:39:54,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 20:39:54,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 20:39:54,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 20:39:54,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 20:39:54,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 20:39:54,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 20:39:54,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 20:39:54,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 20:39:54,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 20:39:54,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 20:39:54,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 20:39:54,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 20:39:54,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 20:39:54,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 20:39:54,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 20:39:54,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 20:39:54,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 20:39:54,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 20:39:54,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 20:39:54,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 20:39:54,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 20:39:54,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 20:39:54,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 20:39:54,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 20:39:54,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 20:39:54,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 20:39:54,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 20:39:54,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 20:39:54,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 20:39:54,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 20:39:54,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 20:39:54,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 20:39:54,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 20:39:54,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 20:39:54,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 20:39:54,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 20:39:54,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 20:39:54,361 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 20:39:54,377 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 20:39:54,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 20:39:54,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 20:39:54,378 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 20:39:54,378 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 20:39:54,378 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 20:39:54,378 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 20:39:54,379 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 20:39:54,379 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 20:39:54,379 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 20:39:54,379 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 20:39:54,379 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 20:39:54,379 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 20:39:54,379 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 20:39:54,379 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 20:39:54,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 20:39:54,380 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 20:39:54,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 20:39:54,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 20:39:54,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 20:39:54,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 20:39:54,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 20:39:54,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 20:39:54,381 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 20:39:54,381 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 20:39:54,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 20:39:54,381 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 20:39:54,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 20:39:54,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 20:39:54,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 20:39:54,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:39:54,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 20:39:54,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 20:39:54,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 20:39:54,382 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 20:39:54,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 20:39:54,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 20:39:54,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 20:39:54,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 20:39:54,382 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_7d1a11e2-edeb-4107-b694-c39012b65962/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_7d1a11e2-edeb-4107-b694-c39012b65962/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 -> 37b183961076d6fcb23260763ff12b2e8c94306b [2020-12-09 20:39:54,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 20:39:54,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 20:39:54,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 20:39:54,569 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 20:39:54,569 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 20:39:54,570 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longest-1.i [2020-12-09 20:39:54,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/data/1ac514356/20fe8d65d66e4b5590fdd6024e3edffe/FLAGe9fd407d1 [2020-12-09 20:39:55,036 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 20:39:55,036 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/sv-benchmarks/c/pthread/triangular-longest-1.i [2020-12-09 20:39:55,050 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/data/1ac514356/20fe8d65d66e4b5590fdd6024e3edffe/FLAGe9fd407d1 [2020-12-09 20:39:55,059 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/data/1ac514356/20fe8d65d66e4b5590fdd6024e3edffe [2020-12-09 20:39:55,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 20:39:55,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 20:39:55,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 20:39:55,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 20:39:55,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 20:39:55,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:39:55" (1/1) ... [2020-12-09 20:39:55,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b68f5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55, skipping insertion in model container [2020-12-09 20:39:55,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:39:55" (1/1) ... [2020-12-09 20:39:55,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 20:39:55,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 20:39:55,320 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_7d1a11e2-edeb-4107-b694-c39012b65962/sv-benchmarks/c/pthread/triangular-longest-1.i[30962,30975] [2020-12-09 20:39:55,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:39:55,329 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 20:39:55,356 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_7d1a11e2-edeb-4107-b694-c39012b65962/sv-benchmarks/c/pthread/triangular-longest-1.i[30962,30975] [2020-12-09 20:39:55,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:39:55,400 INFO L208 MainTranslator]: Completed translation [2020-12-09 20:39:55,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55 WrapperNode [2020-12-09 20:39:55,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 20:39:55,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 20:39:55,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 20:39:55,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 20:39:55,407 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:39:55" (1/1) ... [2020-12-09 20:39:55,419 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:39:55" (1/1) ... [2020-12-09 20:39:55,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 20:39:55,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 20:39:55,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 20:39:55,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 20:39:55,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55" (1/1) ... [2020-12-09 20:39:55,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55" (1/1) ... [2020-12-09 20:39:55,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55" (1/1) ... [2020-12-09 20:39:55,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55" (1/1) ... [2020-12-09 20:39:55,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55" (1/1) ... [2020-12-09 20:39:55,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55" (1/1) ... [2020-12-09 20:39:55,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55" (1/1) ... [2020-12-09 20:39:55,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 20:39:55,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 20:39:55,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 20:39:55,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 20:39:55,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:39:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-12-09 20:39:55,526 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-12-09 20:39:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-12-09 20:39:55,526 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-12-09 20:39:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 20:39:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 20:39:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 20:39:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 20:39:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 20:39:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 20:39:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 20:39:55,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 20:39:55,529 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:39:55,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 20:39:55,810 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-09 20:39:55,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:39:55 BoogieIcfgContainer [2020-12-09 20:39:55,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 20:39:55,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 20:39:55,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 20:39:55,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 20:39:55,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:39:55" (1/3) ... [2020-12-09 20:39:55,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6c9a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:39:55, skipping insertion in model container [2020-12-09 20:39:55,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:39:55" (2/3) ... [2020-12-09 20:39:55,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6c9a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:39:55, skipping insertion in model container [2020-12-09 20:39:55,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:39:55" (3/3) ... [2020-12-09 20:39:55,819 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2020-12-09 20:39:55,829 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 20:39:55,829 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 20:39:55,832 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 20:39:55,832 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 20:39:55,851 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,851 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,851 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,852 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,852 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,852 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,852 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,852 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,852 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,852 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,853 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,853 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,853 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,853 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,853 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,853 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,853 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,853 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,854 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,859 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,859 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,859 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,859 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,859 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,860 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,860 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,860 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,860 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,860 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,860 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,860 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,860 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,861 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,861 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,861 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,861 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,861 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,861 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,861 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,862 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,862 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,862 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,862 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,862 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,862 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,862 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,863 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,863 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,863 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,863 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,863 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,863 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,863 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,863 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,863 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,864 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,865 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,865 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,865 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,865 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,866 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,866 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,869 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,869 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,870 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,870 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,870 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,870 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:39:55,871 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 20:39:55,879 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-12-09 20:39:55,892 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 20:39:55,893 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 20:39:55,893 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 20:39:55,893 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 20:39:55,893 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 20:39:55,893 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 20:39:55,893 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 20:39:55,893 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 20:39:55,900 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 20:39:55,902 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 130 flow [2020-12-09 20:39:55,904 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 130 flow [2020-12-09 20:39:55,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 130 flow [2020-12-09 20:39:55,929 INFO L129 PetriNetUnfolder]: 5/58 cut-off events. [2020-12-09 20:39:55,930 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 20:39:55,933 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:39:55,934 INFO L116 LiptonReduction]: Number of co-enabled transitions 968 [2020-12-09 20:39:57,830 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-09 20:39:58,108 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-09 20:39:58,204 INFO L131 LiptonReduction]: Checked pairs total: 998 [2020-12-09 20:39:58,204 INFO L133 LiptonReduction]: Total number of compositions: 52 [2020-12-09 20:39:58,208 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-12-09 20:39:58,214 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-12-09 20:39:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-12-09 20:39:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 20:39:58,218 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:58,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 20:39:58,219 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:58,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:58,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1332860337, now seen corresponding path program 1 times [2020-12-09 20:39:58,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:58,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364650073] [2020-12-09 20:39:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:58,383 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:39:58,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364650073] [2020-12-09 20:39:58,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:39:58,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 20:39:58,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957704005] [2020-12-09 20:39:58,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:39:58,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:58,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:39:58,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:39:58,400 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-12-09 20:39:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:39:58,462 INFO L93 Difference]: Finished difference Result 83 states and 212 transitions. [2020-12-09 20:39:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:39:58,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 20:39:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:39:58,473 INFO L225 Difference]: With dead ends: 83 [2020-12-09 20:39:58,473 INFO L226 Difference]: Without dead ends: 54 [2020-12-09 20:39:58,474 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:39:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-09 20:39:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2020-12-09 20:39:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-09 20:39:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 120 transitions. [2020-12-09 20:39:58,508 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 120 transitions. Word has length 6 [2020-12-09 20:39:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:39:58,508 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 120 transitions. [2020-12-09 20:39:58,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:39:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 120 transitions. [2020-12-09 20:39:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:39:58,509 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:58,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:39:58,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 20:39:58,510 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash -978539367, now seen corresponding path program 1 times [2020-12-09 20:39:58,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:58,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081802342] [2020-12-09 20:39:58,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:58,577 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:39:58,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081802342] [2020-12-09 20:39:58,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:39:58,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:39:58,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541125167] [2020-12-09 20:39:58,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:39:58,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:58,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:39:58,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:39:58,580 INFO L87 Difference]: Start difference. First operand 50 states and 120 transitions. Second operand 5 states. [2020-12-09 20:39:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:39:58,610 INFO L93 Difference]: Finished difference Result 86 states and 200 transitions. [2020-12-09 20:39:58,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 20:39:58,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 20:39:58,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:39:58,611 INFO L225 Difference]: With dead ends: 86 [2020-12-09 20:39:58,611 INFO L226 Difference]: Without dead ends: 78 [2020-12-09 20:39:58,612 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:39:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-09 20:39:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2020-12-09 20:39:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 20:39:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 137 transitions. [2020-12-09 20:39:58,619 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 137 transitions. Word has length 8 [2020-12-09 20:39:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:39:58,619 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 137 transitions. [2020-12-09 20:39:58,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:39:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 137 transitions. [2020-12-09 20:39:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:39:58,620 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:58,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:39:58,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 20:39:58,621 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:58,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:58,621 INFO L82 PathProgramCache]: Analyzing trace with hash -978459387, now seen corresponding path program 2 times [2020-12-09 20:39:58,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:58,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644717917] [2020-12-09 20:39:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:58,683 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:39:58,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644717917] [2020-12-09 20:39:58,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:39:58,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:39:58,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917986933] [2020-12-09 20:39:58,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:39:58,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:39:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:39:58,685 INFO L87 Difference]: Start difference. First operand 56 states and 137 transitions. Second operand 5 states. [2020-12-09 20:39:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:39:58,719 INFO L93 Difference]: Finished difference Result 62 states and 143 transitions. [2020-12-09 20:39:58,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:39:58,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 20:39:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:39:58,720 INFO L225 Difference]: With dead ends: 62 [2020-12-09 20:39:58,720 INFO L226 Difference]: Without dead ends: 50 [2020-12-09 20:39:58,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 20:39:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-09 20:39:58,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-12-09 20:39:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-09 20:39:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2020-12-09 20:39:58,724 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 8 [2020-12-09 20:39:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:39:58,725 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 98 transitions. [2020-12-09 20:39:58,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:39:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 98 transitions. [2020-12-09 20:39:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:39:58,726 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:58,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:39:58,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 20:39:58,726 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:58,726 INFO L82 PathProgramCache]: Analyzing trace with hash -978842826, now seen corresponding path program 1 times [2020-12-09 20:39:58,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:58,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634285376] [2020-12-09 20:39:58,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:58,771 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:39:58,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634285376] [2020-12-09 20:39:58,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:39:58,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:39:58,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723854048] [2020-12-09 20:39:58,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:39:58,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:58,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:39:58,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:39:58,772 INFO L87 Difference]: Start difference. First operand 42 states and 98 transitions. Second operand 5 states. [2020-12-09 20:39:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:39:58,802 INFO L93 Difference]: Finished difference Result 56 states and 130 transitions. [2020-12-09 20:39:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 20:39:58,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 20:39:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:39:58,803 INFO L225 Difference]: With dead ends: 56 [2020-12-09 20:39:58,803 INFO L226 Difference]: Without dead ends: 50 [2020-12-09 20:39:58,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 20:39:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-09 20:39:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-12-09 20:39:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-09 20:39:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2020-12-09 20:39:58,807 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2020-12-09 20:39:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:39:58,808 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2020-12-09 20:39:58,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:39:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2020-12-09 20:39:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:39:58,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:58,808 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:39:58,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 20:39:58,809 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash 220478720, now seen corresponding path program 1 times [2020-12-09 20:39:58,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:58,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036553329] [2020-12-09 20:39:58,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:58,868 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:39:58,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036553329] [2020-12-09 20:39:58,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:39:58,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:39:58,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147119226] [2020-12-09 20:39:58,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:39:58,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:58,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:39:58,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:39:58,870 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2020-12-09 20:39:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:39:58,917 INFO L93 Difference]: Finished difference Result 58 states and 132 transitions. [2020-12-09 20:39:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:39:58,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:39:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:39:58,918 INFO L225 Difference]: With dead ends: 58 [2020-12-09 20:39:58,918 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 20:39:58,918 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:39:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 20:39:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-12-09 20:39:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 20:39:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 107 transitions. [2020-12-09 20:39:58,922 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 107 transitions. Word has length 10 [2020-12-09 20:39:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:39:58,922 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 107 transitions. [2020-12-09 20:39:58,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:39:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 107 transitions. [2020-12-09 20:39:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:39:58,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:58,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:39:58,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 20:39:58,923 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:58,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash 266866190, now seen corresponding path program 2 times [2020-12-09 20:39:58,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:58,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641398995] [2020-12-09 20:39:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:58,965 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:39:58,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641398995] [2020-12-09 20:39:58,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:39:58,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:39:58,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957967722] [2020-12-09 20:39:58,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:39:58,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:58,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:39:58,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:39:58,967 INFO L87 Difference]: Start difference. First operand 45 states and 107 transitions. Second operand 6 states. [2020-12-09 20:39:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:39:59,004 INFO L93 Difference]: Finished difference Result 78 states and 180 transitions. [2020-12-09 20:39:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 20:39:59,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:39:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:39:59,005 INFO L225 Difference]: With dead ends: 78 [2020-12-09 20:39:59,005 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 20:39:59,005 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:39:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 20:39:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-12-09 20:39:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 20:39:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 113 transitions. [2020-12-09 20:39:59,011 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 113 transitions. Word has length 10 [2020-12-09 20:39:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:39:59,011 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 113 transitions. [2020-12-09 20:39:59,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:39:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 113 transitions. [2020-12-09 20:39:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:39:59,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:59,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:39:59,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 20:39:59,012 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:59,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash 266888510, now seen corresponding path program 3 times [2020-12-09 20:39:59,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:59,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689588339] [2020-12-09 20:39:59,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:59,060 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:39:59,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689588339] [2020-12-09 20:39:59,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:39:59,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:39:59,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156703246] [2020-12-09 20:39:59,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:39:59,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:59,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:39:59,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:39:59,061 INFO L87 Difference]: Start difference. First operand 46 states and 113 transitions. Second operand 6 states. [2020-12-09 20:39:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:39:59,107 INFO L93 Difference]: Finished difference Result 54 states and 125 transitions. [2020-12-09 20:39:59,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:39:59,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:39:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:39:59,108 INFO L225 Difference]: With dead ends: 54 [2020-12-09 20:39:59,109 INFO L226 Difference]: Without dead ends: 43 [2020-12-09 20:39:59,109 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:39:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-09 20:39:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2020-12-09 20:39:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-09 20:39:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 80 transitions. [2020-12-09 20:39:59,111 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 80 transitions. Word has length 10 [2020-12-09 20:39:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:39:59,112 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 80 transitions. [2020-12-09 20:39:59,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:39:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 80 transitions. [2020-12-09 20:39:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:39:59,112 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:59,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:39:59,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 20:39:59,112 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:59,113 INFO L82 PathProgramCache]: Analyzing trace with hash 266773190, now seen corresponding path program 4 times [2020-12-09 20:39:59,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:59,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924958400] [2020-12-09 20:39:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:59,152 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:39:59,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924958400] [2020-12-09 20:39:59,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:39:59,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:39:59,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650611616] [2020-12-09 20:39:59,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:39:59,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:59,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:39:59,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:39:59,154 INFO L87 Difference]: Start difference. First operand 34 states and 80 transitions. Second operand 6 states. [2020-12-09 20:39:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:39:59,199 INFO L93 Difference]: Finished difference Result 57 states and 133 transitions. [2020-12-09 20:39:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:39:59,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:39:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:39:59,200 INFO L225 Difference]: With dead ends: 57 [2020-12-09 20:39:59,200 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 20:39:59,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-12-09 20:39:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 20:39:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2020-12-09 20:39:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-09 20:39:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2020-12-09 20:39:59,203 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 10 [2020-12-09 20:39:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:39:59,203 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2020-12-09 20:39:59,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:39:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2020-12-09 20:39:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 20:39:59,204 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:59,204 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:39:59,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 20:39:59,204 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:59,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1755209235, now seen corresponding path program 5 times [2020-12-09 20:39:59,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:59,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703562437] [2020-12-09 20:39:59,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:59,248 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:39:59,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703562437] [2020-12-09 20:39:59,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983045173] [2020-12-09 20:39:59,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:39:59,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 20:39:59,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:39:59,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 20:39:59,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:39:59,357 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:39:59,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:39:59,364 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:39:59,364 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:39:59,376 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:39:59,390 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:39:59,403 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:39:59,426 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:39:59,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [650718471] [2020-12-09 20:39:59,431 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:39:59,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:39:59,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2020-12-09 20:39:59,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381839943] [2020-12-09 20:39:59,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 20:39:59,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:59,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 20:39:59,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-09 20:39:59,433 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand 12 states. [2020-12-09 20:39:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:39:59,548 INFO L93 Difference]: Finished difference Result 71 states and 159 transitions. [2020-12-09 20:39:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 20:39:59,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-12-09 20:39:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:39:59,549 INFO L225 Difference]: With dead ends: 71 [2020-12-09 20:39:59,549 INFO L226 Difference]: Without dead ends: 53 [2020-12-09 20:39:59,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2020-12-09 20:39:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-09 20:39:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2020-12-09 20:39:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 20:39:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 115 transitions. [2020-12-09 20:39:59,552 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 115 transitions. Word has length 11 [2020-12-09 20:39:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:39:59,552 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 115 transitions. [2020-12-09 20:39:59,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 20:39:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 115 transitions. [2020-12-09 20:39:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 20:39:59,553 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:39:59,553 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:39:59,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-09 20:39:59,754 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:39:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:39:59,755 INFO L82 PathProgramCache]: Analyzing trace with hash -316364261, now seen corresponding path program 6 times [2020-12-09 20:39:59,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:39:59,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415416909] [2020-12-09 20:39:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:39:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:39:59,823 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:39:59,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415416909] [2020-12-09 20:39:59,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166296825] [2020-12-09 20:39:59,824 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:39:59,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:39:59,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:39:59,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 20:39:59,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:39:59,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:39:59,921 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:39:59,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:39:59,923 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:39:59,923 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:39:59,941 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:39:59,970 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:39:59,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683950351] [2020-12-09 20:39:59,970 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:39:59,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:39:59,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2020-12-09 20:39:59,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847595393] [2020-12-09 20:39:59,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 20:39:59,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:39:59,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 20:39:59,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-09 20:39:59,972 INFO L87 Difference]: Start difference. First operand 49 states and 115 transitions. Second operand 13 states. [2020-12-09 20:40:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:00,168 INFO L93 Difference]: Finished difference Result 89 states and 211 transitions. [2020-12-09 20:40:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 20:40:00,169 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-12-09 20:40:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:00,170 INFO L225 Difference]: With dead ends: 89 [2020-12-09 20:40:00,170 INFO L226 Difference]: Without dead ends: 64 [2020-12-09 20:40:00,170 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:40:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-09 20:40:00,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2020-12-09 20:40:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-09 20:40:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 128 transitions. [2020-12-09 20:40:00,175 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 128 transitions. Word has length 11 [2020-12-09 20:40:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:00,175 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 128 transitions. [2020-12-09 20:40:00,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 20:40:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 128 transitions. [2020-12-09 20:40:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 20:40:00,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:00,176 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:00,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 20:40:00,378 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1554804726, now seen corresponding path program 7 times [2020-12-09 20:40:00,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:00,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999578360] [2020-12-09 20:40:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:00,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:40:00,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999578360] [2020-12-09 20:40:00,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393839695] [2020-12-09 20:40:00,562 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:00,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 20:40:00,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:00,625 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:40:00,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:00,627 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:00,627 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:00,639 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:00,651 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:00,664 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:00,714 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:40:00,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [558364122] [2020-12-09 20:40:00,714 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:40:00,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:00,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-12-09 20:40:00,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899801720] [2020-12-09 20:40:00,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 20:40:00,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:00,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 20:40:00,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-12-09 20:40:00,716 INFO L87 Difference]: Start difference. First operand 54 states and 128 transitions. Second operand 16 states. [2020-12-09 20:40:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:00,940 INFO L93 Difference]: Finished difference Result 148 states and 331 transitions. [2020-12-09 20:40:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-09 20:40:00,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-12-09 20:40:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:00,942 INFO L225 Difference]: With dead ends: 148 [2020-12-09 20:40:00,942 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 20:40:00,942 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:40:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 20:40:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2020-12-09 20:40:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-09 20:40:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 171 transitions. [2020-12-09 20:40:00,949 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 171 transitions. Word has length 14 [2020-12-09 20:40:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:00,949 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 171 transitions. [2020-12-09 20:40:00,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 20:40:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 171 transitions. [2020-12-09 20:40:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 20:40:00,950 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:00,950 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:01,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-09 20:40:01,152 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:01,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:01,153 INFO L82 PathProgramCache]: Analyzing trace with hash -867590526, now seen corresponding path program 8 times [2020-12-09 20:40:01,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:01,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203420617] [2020-12-09 20:40:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:01,303 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:40:01,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203420617] [2020-12-09 20:40:01,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64867318] [2020-12-09 20:40:01,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:01,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 20:40:01,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:40:01,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 20:40:01,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:01,391 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:40:01,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:01,400 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:01,400 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:01,476 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:40:01,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1666642102] [2020-12-09 20:40:01,476 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:40:01,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:01,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-12-09 20:40:01,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233780238] [2020-12-09 20:40:01,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 20:40:01,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:01,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 20:40:01,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-12-09 20:40:01,478 INFO L87 Difference]: Start difference. First operand 69 states and 171 transitions. Second operand 16 states. [2020-12-09 20:40:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:01,829 INFO L93 Difference]: Finished difference Result 153 states and 367 transitions. [2020-12-09 20:40:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 20:40:01,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-12-09 20:40:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:01,830 INFO L225 Difference]: With dead ends: 153 [2020-12-09 20:40:01,830 INFO L226 Difference]: Without dead ends: 105 [2020-12-09 20:40:01,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=446, Invalid=960, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 20:40:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-12-09 20:40:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2020-12-09 20:40:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 20:40:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2020-12-09 20:40:01,834 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2020-12-09 20:40:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:01,834 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2020-12-09 20:40:01,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 20:40:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2020-12-09 20:40:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 20:40:01,835 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:01,835 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:02,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:40:02,037 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash -695615729, now seen corresponding path program 9 times [2020-12-09 20:40:02,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:02,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614352246] [2020-12-09 20:40:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:02,153 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:40:02,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614352246] [2020-12-09 20:40:02,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043552374] [2020-12-09 20:40:02,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:02,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:40:02,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:40:02,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 20:40:02,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:02,222 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:40:02,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:02,223 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:02,224 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:02,227 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:02,238 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:02,251 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:02,263 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:02,277 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:02,333 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:40:02,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1963853667] [2020-12-09 20:40:02,333 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:40:02,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:02,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2020-12-09 20:40:02,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574046648] [2020-12-09 20:40:02,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 20:40:02,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:02,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 20:40:02,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2020-12-09 20:40:02,335 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand 22 states. [2020-12-09 20:40:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:02,713 INFO L93 Difference]: Finished difference Result 209 states and 472 transitions. [2020-12-09 20:40:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-09 20:40:02,713 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2020-12-09 20:40:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:02,714 INFO L225 Difference]: With dead ends: 209 [2020-12-09 20:40:02,714 INFO L226 Difference]: Without dead ends: 172 [2020-12-09 20:40:02,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=599, Invalid=1563, Unknown=0, NotChecked=0, Total=2162 [2020-12-09 20:40:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-09 20:40:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 83. [2020-12-09 20:40:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-12-09 20:40:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 212 transitions. [2020-12-09 20:40:02,719 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 212 transitions. Word has length 17 [2020-12-09 20:40:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:02,719 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 212 transitions. [2020-12-09 20:40:02,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 20:40:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 212 transitions. [2020-12-09 20:40:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 20:40:02,720 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:02,720 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:02,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-09 20:40:02,921 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:02,922 INFO L82 PathProgramCache]: Analyzing trace with hash -759426769, now seen corresponding path program 10 times [2020-12-09 20:40:02,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:02,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080309921] [2020-12-09 20:40:02,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:03,007 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:40:03,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080309921] [2020-12-09 20:40:03,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486298381] [2020-12-09 20:40:03,008 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:03,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 20:40:03,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:03,078 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:40:03,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:03,080 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:03,080 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:03,100 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:03,186 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:40:03,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1767048832] [2020-12-09 20:40:03,187 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:40:03,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:03,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2020-12-09 20:40:03,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166744178] [2020-12-09 20:40:03,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 20:40:03,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:03,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 20:40:03,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2020-12-09 20:40:03,188 INFO L87 Difference]: Start difference. First operand 83 states and 212 transitions. Second operand 23 states. [2020-12-09 20:40:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:03,744 INFO L93 Difference]: Finished difference Result 177 states and 429 transitions. [2020-12-09 20:40:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-09 20:40:03,744 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 17 [2020-12-09 20:40:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:03,745 INFO L225 Difference]: With dead ends: 177 [2020-12-09 20:40:03,745 INFO L226 Difference]: Without dead ends: 115 [2020-12-09 20:40:03,746 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:40:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-09 20:40:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 61. [2020-12-09 20:40:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 20:40:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 148 transitions. [2020-12-09 20:40:03,749 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 148 transitions. Word has length 17 [2020-12-09 20:40:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:03,749 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 148 transitions. [2020-12-09 20:40:03,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 20:40:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 148 transitions. [2020-12-09 20:40:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 20:40:03,749 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:03,749 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:03,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:40:03,951 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:03,952 INFO L82 PathProgramCache]: Analyzing trace with hash -670224702, now seen corresponding path program 11 times [2020-12-09 20:40:03,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:03,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130208292] [2020-12-09 20:40:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:04,110 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:40:04,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130208292] [2020-12-09 20:40:04,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722563049] [2020-12-09 20:40:04,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:04,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2020-12-09 20:40:04,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:40:04,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 20:40:04,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:04,219 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:40:04,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:04,220 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:04,221 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:04,463 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:40:04,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2009265409] [2020-12-09 20:40:04,464 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:40:04,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:04,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2020-12-09 20:40:04,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220290399] [2020-12-09 20:40:04,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-09 20:40:04,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-09 20:40:04,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1065, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 20:40:04,466 INFO L87 Difference]: Start difference. First operand 61 states and 148 transitions. Second operand 38 states. [2020-12-09 20:40:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:05,815 INFO L93 Difference]: Finished difference Result 236 states and 583 transitions. [2020-12-09 20:40:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2020-12-09 20:40:05,815 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 24 [2020-12-09 20:40:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:05,816 INFO L225 Difference]: With dead ends: 236 [2020-12-09 20:40:05,816 INFO L226 Difference]: Without dead ends: 132 [2020-12-09 20:40:05,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3390 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3172, Invalid=7334, Unknown=0, NotChecked=0, Total=10506 [2020-12-09 20:40:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-09 20:40:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2020-12-09 20:40:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-12-09 20:40:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 241 transitions. [2020-12-09 20:40:05,822 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 241 transitions. Word has length 24 [2020-12-09 20:40:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:05,822 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 241 transitions. [2020-12-09 20:40:05,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-09 20:40:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 241 transitions. [2020-12-09 20:40:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 20:40:05,823 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:05,823 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:06,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-09 20:40:06,025 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:06,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1199398136, now seen corresponding path program 12 times [2020-12-09 20:40:06,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:06,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371866042] [2020-12-09 20:40:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:06,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371866042] [2020-12-09 20:40:06,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321245825] [2020-12-09 20:40:06,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:06,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:40:06,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:40:06,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-09 20:40:06,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:06,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:06,657 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:06,657 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,659 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,680 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,702 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,724 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,747 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,769 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,795 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,819 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,843 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,869 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,872 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,874 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,876 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,879 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,881 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,883 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,886 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,888 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,890 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,893 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,895 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,897 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,899 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,901 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,904 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,906 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,908 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,910 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,912 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,915 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:06,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1418260061] [2020-12-09 20:40:06,940 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:40:06,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:06,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 44 [2020-12-09 20:40:06,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666494687] [2020-12-09 20:40:06,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-12-09 20:40:06,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:06,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-12-09 20:40:06,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=1578, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 20:40:06,942 INFO L87 Difference]: Start difference. First operand 98 states and 241 transitions. Second operand 46 states. [2020-12-09 20:40:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:07,985 INFO L93 Difference]: Finished difference Result 211 states and 468 transitions. [2020-12-09 20:40:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-12-09 20:40:07,986 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 38 [2020-12-09 20:40:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:07,987 INFO L225 Difference]: With dead ends: 211 [2020-12-09 20:40:07,987 INFO L226 Difference]: Without dead ends: 174 [2020-12-09 20:40:07,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2337, Invalid=5319, Unknown=0, NotChecked=0, Total=7656 [2020-12-09 20:40:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-09 20:40:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 110. [2020-12-09 20:40:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 20:40:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 266 transitions. [2020-12-09 20:40:07,992 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 266 transitions. Word has length 38 [2020-12-09 20:40:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:07,992 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 266 transitions. [2020-12-09 20:40:07,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-12-09 20:40:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 266 transitions. [2020-12-09 20:40:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 20:40:07,993 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:07,993 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:08,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-09 20:40:08,195 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:08,197 INFO L82 PathProgramCache]: Analyzing trace with hash -743691002, now seen corresponding path program 13 times [2020-12-09 20:40:08,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:08,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882946576] [2020-12-09 20:40:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:08,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882946576] [2020-12-09 20:40:08,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672800112] [2020-12-09 20:40:08,655 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:08,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2020-12-09 20:40:08,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:08,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:08,768 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:08,769 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,771 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,792 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,814 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,836 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,861 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,883 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,905 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,927 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,950 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,973 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,975 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,977 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,979 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,981 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,983 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,985 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,987 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,989 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,991 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,993 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,995 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,997 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:08,999 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:09,002 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:09,004 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:09,006 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:09,008 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:09,010 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:09,012 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:09,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1407229812] [2020-12-09 20:40:09,049 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:40:09,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:09,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 44 [2020-12-09 20:40:09,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191768010] [2020-12-09 20:40:09,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-12-09 20:40:09,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:09,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-12-09 20:40:09,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1587, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 20:40:09,051 INFO L87 Difference]: Start difference. First operand 110 states and 266 transitions. Second operand 46 states. [2020-12-09 20:40:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:09,898 INFO L93 Difference]: Finished difference Result 325 states and 699 transitions. [2020-12-09 20:40:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-12-09 20:40:09,898 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 38 [2020-12-09 20:40:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:09,900 INFO L225 Difference]: With dead ends: 325 [2020-12-09 20:40:09,900 INFO L226 Difference]: Without dead ends: 288 [2020-12-09 20:40:09,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1708 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2336, Invalid=5674, Unknown=0, NotChecked=0, Total=8010 [2020-12-09 20:40:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-12-09 20:40:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 113. [2020-12-09 20:40:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-09 20:40:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 275 transitions. [2020-12-09 20:40:09,906 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 275 transitions. Word has length 38 [2020-12-09 20:40:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:09,906 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 275 transitions. [2020-12-09 20:40:09,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-12-09 20:40:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 275 transitions. [2020-12-09 20:40:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 20:40:09,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:09,907 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:10,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-09 20:40:10,108 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:10,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:10,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1520936970, now seen corresponding path program 14 times [2020-12-09 20:40:10,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:10,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147036332] [2020-12-09 20:40:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:10,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147036332] [2020-12-09 20:40:10,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980751787] [2020-12-09 20:40:10,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:10,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2020-12-09 20:40:10,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:40:10,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2020-12-09 20:40:10,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:10,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:10,616 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:10,616 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,619 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,640 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,661 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,682 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,703 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,725 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,747 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,772 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,794 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,815 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,817 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,820 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,822 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,824 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,826 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,828 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,830 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,833 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,835 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,837 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,839 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,841 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,843 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,845 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,847 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:10,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1717804681] [2020-12-09 20:40:10,951 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:40:10,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:10,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 48 [2020-12-09 20:40:10,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044449822] [2020-12-09 20:40:10,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-12-09 20:40:10,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:10,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-12-09 20:40:10,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2020-12-09 20:40:10,953 INFO L87 Difference]: Start difference. First operand 113 states and 275 transitions. Second operand 50 states. [2020-12-09 20:40:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:12,036 INFO L93 Difference]: Finished difference Result 322 states and 701 transitions. [2020-12-09 20:40:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2020-12-09 20:40:12,036 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 38 [2020-12-09 20:40:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:12,038 INFO L225 Difference]: With dead ends: 322 [2020-12-09 20:40:12,038 INFO L226 Difference]: Without dead ends: 284 [2020-12-09 20:40:12,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2488 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2594, Invalid=7708, Unknown=0, NotChecked=0, Total=10302 [2020-12-09 20:40:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-12-09 20:40:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 122. [2020-12-09 20:40:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-09 20:40:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 301 transitions. [2020-12-09 20:40:12,044 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 301 transitions. Word has length 38 [2020-12-09 20:40:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:12,044 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 301 transitions. [2020-12-09 20:40:12,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-12-09 20:40:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 301 transitions. [2020-12-09 20:40:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 20:40:12,045 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:12,045 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:12,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-09 20:40:12,247 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:12,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:12,248 INFO L82 PathProgramCache]: Analyzing trace with hash -898787882, now seen corresponding path program 15 times [2020-12-09 20:40:12,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:12,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022951528] [2020-12-09 20:40:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:12,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022951528] [2020-12-09 20:40:12,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543004467] [2020-12-09 20:40:12,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:12,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:40:12,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:40:12,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2020-12-09 20:40:12,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:12,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:12,757 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:12,757 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,760 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,780 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,801 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,821 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,844 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,866 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,888 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,910 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,931 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,957 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,960 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,963 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,966 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,969 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,972 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,975 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:12,978 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:13,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1104566488] [2020-12-09 20:40:13,182 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:40:13,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:13,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 52 [2020-12-09 20:40:13,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053348928] [2020-12-09 20:40:13,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 54 states [2020-12-09 20:40:13,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:13,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2020-12-09 20:40:13,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=2407, Unknown=0, NotChecked=0, Total=2862 [2020-12-09 20:40:13,184 INFO L87 Difference]: Start difference. First operand 122 states and 301 transitions. Second operand 54 states. [2020-12-09 20:40:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:14,749 INFO L93 Difference]: Finished difference Result 307 states and 683 transitions. [2020-12-09 20:40:14,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2020-12-09 20:40:14,750 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 38 [2020-12-09 20:40:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:14,751 INFO L225 Difference]: With dead ends: 307 [2020-12-09 20:40:14,751 INFO L226 Difference]: Without dead ends: 269 [2020-12-09 20:40:14,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3663 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3258, Invalid=10314, Unknown=0, NotChecked=0, Total=13572 [2020-12-09 20:40:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-12-09 20:40:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 133. [2020-12-09 20:40:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-12-09 20:40:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 335 transitions. [2020-12-09 20:40:14,757 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 335 transitions. Word has length 38 [2020-12-09 20:40:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:14,757 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 335 transitions. [2020-12-09 20:40:14,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2020-12-09 20:40:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 335 transitions. [2020-12-09 20:40:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 20:40:14,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:14,758 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:14,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:40:14,959 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash -269896026, now seen corresponding path program 16 times [2020-12-09 20:40:14,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:14,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265310616] [2020-12-09 20:40:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:15,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265310616] [2020-12-09 20:40:15,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547382398] [2020-12-09 20:40:15,316 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:15,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2020-12-09 20:40:15,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:15,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:15,424 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:15,424 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:15,426 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:15,445 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:15,464 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:15,483 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:15,507 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:15,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [674186349] [2020-12-09 20:40:15,754 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:40:15,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:15,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 48 [2020-12-09 20:40:15,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841313605] [2020-12-09 20:40:15,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-12-09 20:40:15,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:15,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-12-09 20:40:15,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2020-12-09 20:40:15,755 INFO L87 Difference]: Start difference. First operand 133 states and 335 transitions. Second operand 50 states. [2020-12-09 20:40:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:17,492 INFO L93 Difference]: Finished difference Result 307 states and 721 transitions. [2020-12-09 20:40:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-12-09 20:40:17,492 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 38 [2020-12-09 20:40:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:17,494 INFO L225 Difference]: With dead ends: 307 [2020-12-09 20:40:17,494 INFO L226 Difference]: Without dead ends: 251 [2020-12-09 20:40:17,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4391 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4348, Invalid=11152, Unknown=0, NotChecked=0, Total=15500 [2020-12-09 20:40:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-12-09 20:40:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 116. [2020-12-09 20:40:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-12-09 20:40:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 288 transitions. [2020-12-09 20:40:17,499 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 288 transitions. Word has length 38 [2020-12-09 20:40:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:17,499 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 288 transitions. [2020-12-09 20:40:17,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-12-09 20:40:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 288 transitions. [2020-12-09 20:40:17,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-09 20:40:17,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:17,500 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:17,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:40:17,701 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:17,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:17,702 INFO L82 PathProgramCache]: Analyzing trace with hash -275542961, now seen corresponding path program 17 times [2020-12-09 20:40:17,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:17,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460354628] [2020-12-09 20:40:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:18,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460354628] [2020-12-09 20:40:18,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277156499] [2020-12-09 20:40:18,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:18,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2020-12-09 20:40:18,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:40:18,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-09 20:40:18,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:18,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:18,304 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:40:18,304 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:40:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:18,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1202119492] [2020-12-09 20:40:18,512 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:40:18,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:40:18,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 47 [2020-12-09 20:40:18,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993151977] [2020-12-09 20:40:18,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 49 states [2020-12-09 20:40:18,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:18,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-12-09 20:40:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1801, Unknown=0, NotChecked=0, Total=2352 [2020-12-09 20:40:18,514 INFO L87 Difference]: Start difference. First operand 116 states and 288 transitions. Second operand 49 states. [2020-12-09 20:40:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:20,683 INFO L93 Difference]: Finished difference Result 308 states and 737 transitions. [2020-12-09 20:40:20,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2020-12-09 20:40:20,684 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 43 [2020-12-09 20:40:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:20,685 INFO L225 Difference]: With dead ends: 308 [2020-12-09 20:40:20,685 INFO L226 Difference]: Without dead ends: 247 [2020-12-09 20:40:20,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5394 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5229, Invalid=13131, Unknown=0, NotChecked=0, Total=18360 [2020-12-09 20:40:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-12-09 20:40:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 121. [2020-12-09 20:40:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-09 20:40:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 297 transitions. [2020-12-09 20:40:20,692 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 297 transitions. Word has length 43 [2020-12-09 20:40:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:20,692 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 297 transitions. [2020-12-09 20:40:20,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2020-12-09 20:40:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 297 transitions. [2020-12-09 20:40:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-09 20:40:20,692 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:40:20,692 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:40:20,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-09 20:40:20,894 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:40:20,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:40:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -501544441, now seen corresponding path program 18 times [2020-12-09 20:40:20,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:40:20,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25017429] [2020-12-09 20:40:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:40:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:40:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 380 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:21,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25017429] [2020-12-09 20:40:21,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078198985] [2020-12-09 20:40:21,137 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/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:40:21,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:40:21,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:40:21,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 20:40:21,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:40:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:21,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:40:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:40:21,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 20:40:21,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 23] imperfect sequences [23] total 24 [2020-12-09 20:40:21,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861984030] [2020-12-09 20:40:21,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 20:40:21,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:40:21,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 20:40:21,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:40:21,289 INFO L87 Difference]: Start difference. First operand 121 states and 297 transitions. Second operand 23 states. [2020-12-09 20:40:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:40:21,324 INFO L93 Difference]: Finished difference Result 1019 states and 2433 transitions. [2020-12-09 20:40:21,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-09 20:40:21,325 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2020-12-09 20:40:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:40:21,325 INFO L225 Difference]: With dead ends: 1019 [2020-12-09 20:40:21,325 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 20:40:21,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:40:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 20:40:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 20:40:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 20:40:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 20:40:21,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2020-12-09 20:40:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:40:21,326 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 20:40:21,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 20:40:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 20:40:21,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 20:40:21,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:40:21,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:40:21 BasicIcfg [2020-12-09 20:40:21,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 20:40:21,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 20:40:21,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 20:40:21,536 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 20:40:21,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:39:55" (3/4) ... [2020-12-09 20:40:21,544 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 20:40:21,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2020-12-09 20:40:21,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2020-12-09 20:40:21,565 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2020-12-09 20:40:21,565 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 20:40:21,566 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 20:40:21,566 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 20:40:21,590 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7d1a11e2-edeb-4107-b694-c39012b65962/bin/utaipan/witness.graphml [2020-12-09 20:40:21,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 20:40:21,591 INFO L168 Benchmark]: Toolchain (without parser) took 26528.98 ms. Allocated memory was 115.3 MB in the beginning and 174.1 MB in the end (delta: 58.7 MB). Free memory was 78.0 MB in the beginning and 111.1 MB in the end (delta: -33.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 16.1 GB. [2020-12-09 20:40:21,591 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 115.3 MB. Free memory is still 95.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:40:21,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.70 ms. Allocated memory is still 115.3 MB. Free memory was 77.8 MB in the beginning and 72.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 20:40:21,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.27 ms. Allocated memory is still 115.3 MB. Free memory was 72.8 MB in the beginning and 71.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:40:21,592 INFO L168 Benchmark]: Boogie Preprocessor took 22.62 ms. Allocated memory is still 115.3 MB. Free memory was 70.8 MB in the beginning and 69.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:40:21,592 INFO L168 Benchmark]: RCFGBuilder took 354.30 ms. Allocated memory is still 115.3 MB. Free memory was 69.7 MB in the beginning and 49.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 20:40:21,593 INFO L168 Benchmark]: TraceAbstraction took 25720.70 ms. Allocated memory was 115.3 MB in the beginning and 174.1 MB in the end (delta: 58.7 MB). Free memory was 49.3 MB in the beginning and 112.7 MB in the end (delta: -63.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:40:21,593 INFO L168 Benchmark]: Witness Printer took 55.61 ms. Allocated memory is still 174.1 MB. Free memory was 112.7 MB in the beginning and 111.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:40:21,594 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.11 ms. Allocated memory is still 115.3 MB. Free memory is still 95.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 337.70 ms. Allocated memory is still 115.3 MB. Free memory was 77.8 MB in the beginning and 72.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.27 ms. Allocated memory is still 115.3 MB. Free memory was 72.8 MB in the beginning and 71.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.62 ms. Allocated memory is still 115.3 MB. Free memory was 70.8 MB in the beginning and 69.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 354.30 ms. Allocated memory is still 115.3 MB. Free memory was 69.7 MB in the beginning and 49.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25720.70 ms. Allocated memory was 115.3 MB in the beginning and 174.1 MB in the end (delta: 58.7 MB). Free memory was 49.3 MB in the beginning and 112.7 MB in the end (delta: -63.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 55.61 ms. Allocated memory is still 174.1 MB. Free memory was 112.7 MB in the beginning and 111.1 MB in the end (delta: 1.6 MB). There was no memory consumed. 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: 2.3s, 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: 25.6s, OverallIterations: 22, TraceHistogramMax: 21, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 417 SDtfs, 2948 SDslu, 1750 SDs, 0 SdLazy, 2328 SolverSat, 3079 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1624 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 1021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24617 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1174 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 850 NumberOfCodeBlocks, 849 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1190 ConstructedInterpolants, 0 QuantifiedInterpolants, 170040 SizeOfPredicates, 234 NumberOfNonLiveVariables, 2505 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 50 InterpolantComputations, 10 PerfectInterpolantSequences, 1192/5529 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...