./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b34aa4c2467f96ebe08cbccd6e971201d28a8fd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:14:09,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:14:09,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:14:09,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:14:09,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:14:09,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:14:09,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:14:09,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:14:09,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:14:09,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:14:09,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:14:09,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:14:09,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:14:09,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:14:09,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:14:09,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:14:09,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:14:09,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:14:09,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:14:09,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:14:09,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:14:09,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:14:09,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:14:09,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:14:09,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:14:09,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:14:09,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:14:09,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:14:09,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:14:09,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:14:09,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:14:09,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:14:09,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:14:09,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:14:09,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:14:09,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:14:09,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:14:09,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:14:09,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:14:09,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:14:09,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:14:09,992 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:14:10,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:14:10,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:14:10,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:14:10,003 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:14:10,003 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:14:10,003 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:14:10,003 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:14:10,003 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:14:10,003 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:14:10,003 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:14:10,003 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:14:10,004 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:14:10,004 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:14:10,004 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:14:10,004 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:14:10,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:14:10,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:14:10,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:14:10,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:14:10,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:14:10,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:14:10,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:14:10,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:14:10,005 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:14:10,005 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:14:10,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:14:10,006 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:14:10,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:14:10,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:14:10,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:14:10,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:14:10,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:14:10,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:14:10,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:14:10,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:14:10,007 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:14:10,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:14:10,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:14:10,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:14:10,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:14:10,007 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_06644470-385f-45df-aebe-ed4296a90547/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(__VERIFIER_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 -> 9b34aa4c2467f96ebe08cbccd6e971201d28a8fd [2019-12-07 20:14:10,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:14:10,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:14:10,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:14:10,115 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:14:10,115 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:14:10,116 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longest-1.i [2019-12-07 20:14:10,151 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/data/6cc664cc9/6ec5b943074940f0a0c9c6575729ca5d/FLAG9ed352432 [2019-12-07 20:14:10,614 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:14:10,614 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/sv-benchmarks/c/pthread/triangular-longest-1.i [2019-12-07 20:14:10,623 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/data/6cc664cc9/6ec5b943074940f0a0c9c6575729ca5d/FLAG9ed352432 [2019-12-07 20:14:10,633 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/data/6cc664cc9/6ec5b943074940f0a0c9c6575729ca5d [2019-12-07 20:14:10,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:14:10,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:14:10,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:14:10,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:14:10,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:14:10,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:10,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6f7d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10, skipping insertion in model container [2019-12-07 20:14:10,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:10,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:14:10,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:14:10,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:14:10,892 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:14:10,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:14:10,962 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:14:10,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10 WrapperNode [2019-12-07 20:14:10,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:14:10,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:14:10,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:14:10,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:14:10,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:10,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:10,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:14:10,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:14:10,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:14:10,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:14:10,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:10,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:11,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:11,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:11,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:11,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:11,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... [2019-12-07 20:14:11,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:14:11,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:14:11,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:14:11,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:14:11,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/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 [2019-12-07 20:14:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-07 20:14:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-07 20:14:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-07 20:14:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-07 20:14:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:14:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:14:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:14:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:14:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:14:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:14:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:14:11,055 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:14:11,226 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:14:11,226 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 20:14:11,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:14:11 BoogieIcfgContainer [2019-12-07 20:14:11,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:14:11,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:14:11,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:14:11,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:14:11,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:14:10" (1/3) ... [2019-12-07 20:14:11,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a267c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:14:11, skipping insertion in model container [2019-12-07 20:14:11,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:14:10" (2/3) ... [2019-12-07 20:14:11,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a267c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:14:11, skipping insertion in model container [2019-12-07 20:14:11,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:14:11" (3/3) ... [2019-12-07 20:14:11,231 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2019-12-07 20:14:11,237 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:14:11,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:14:11,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:14:11,242 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:14:11,258 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,259 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,259 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,259 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,259 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,259 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,259 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,260 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,260 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,260 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,260 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,260 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,260 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,260 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,260 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,261 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,261 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,261 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,261 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,261 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,262 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,262 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,262 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,262 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,262 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:14:11,275 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-07 20:14:11,287 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:14:11,288 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:14:11,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:14:11,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:14:11,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:14:11,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:14:11,288 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:14:11,288 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:14:11,296 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-07 20:14:11,297 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-07 20:14:11,321 INFO L134 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-07 20:14:11,321 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:14:11,326 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-07 20:14:11,327 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-07 20:14:11,336 INFO L134 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-07 20:14:11,336 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:14:11,337 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-07 20:14:11,338 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-07 20:14:11,339 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:14:11,996 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-07 20:14:11,996 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-07 20:14:11,999 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-07 20:14:12,006 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-07 20:14:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-07 20:14:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:14:12,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:12,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:14:12,012 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:12,016 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-07 20:14:12,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:12,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577569971] [2019-12-07 20:14:12,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:12,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577569971] [2019-12-07 20:14:12,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:12,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:14:12,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114388887] [2019-12-07 20:14:12,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:14:12,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:14:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:12,188 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-07 20:14:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:12,210 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-07 20:14:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:14:12,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 20:14:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:12,219 INFO L225 Difference]: With dead ends: 48 [2019-12-07 20:14:12,219 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 20:14:12,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 20:14:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 20:14:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 20:14:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-07 20:14:12,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-07 20:14:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:12,245 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-07 20:14:12,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:14:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-07 20:14:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:14:12,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:12,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:12,245 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:12,246 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-07 20:14:12,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:12,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796911548] [2019-12-07 20:14:12,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:12,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796911548] [2019-12-07 20:14:12,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:12,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:14:12,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552213429] [2019-12-07 20:14:12,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:14:12,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:12,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:14:12,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:14:12,310 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-07 20:14:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:12,337 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-07 20:14:12,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:14:12,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 20:14:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:12,338 INFO L225 Difference]: With dead ends: 38 [2019-12-07 20:14:12,338 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 20:14:12,339 INFO L630 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 [2019-12-07 20:14:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 20:14:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-07 20:14:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 20:14:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-07 20:14:12,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 7 [2019-12-07 20:14:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:12,343 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-07 20:14:12,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:14:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-07 20:14:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:14:12,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:12,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:12,344 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:12,344 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 1 times [2019-12-07 20:14:12,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:12,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111180176] [2019-12-07 20:14:12,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:12,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111180176] [2019-12-07 20:14:12,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:12,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:14:12,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082541808] [2019-12-07 20:14:12,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:14:12,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:12,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:14:12,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:14:12,399 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-07 20:14:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:12,444 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-07 20:14:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:14:12,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 20:14:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:12,445 INFO L225 Difference]: With dead ends: 36 [2019-12-07 20:14:12,445 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 20:14:12,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:14:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 20:14:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-12-07 20:14:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 20:14:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-07 20:14:12,449 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 9 [2019-12-07 20:14:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:12,449 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-07 20:14:12,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:14:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-07 20:14:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:14:12,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:12,450 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:12,450 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:12,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 2 times [2019-12-07 20:14:12,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:12,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596523962] [2019-12-07 20:14:12,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:12,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596523962] [2019-12-07 20:14:12,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718216501] [2019-12-07 20:14:12,512 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/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 [2019-12-07 20:14:12,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 20:14:12,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:14:12,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:14:12,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:12,577 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:12,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:12,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:12,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:12,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108704224] [2019-12-07 20:14:12,622 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:14:12,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:14:12,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-12-07 20:14:12,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643320947] [2019-12-07 20:14:12,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:14:12,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:12,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:14:12,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:14:12,624 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 11 states. [2019-12-07 20:14:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:12,710 INFO L93 Difference]: Finished difference Result 49 states and 100 transitions. [2019-12-07 20:14:12,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:14:12,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-12-07 20:14:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:12,711 INFO L225 Difference]: With dead ends: 49 [2019-12-07 20:14:12,711 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 20:14:12,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:14:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 20:14:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-12-07 20:14:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 20:14:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-07 20:14:12,715 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 10 [2019-12-07 20:14:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:12,715 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-07 20:14:12,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:14:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-07 20:14:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:14:12,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:12,716 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:12,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:14:12,917 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 3 times [2019-12-07 20:14:12,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:12,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506973661] [2019-12-07 20:14:12,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:13,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506973661] [2019-12-07 20:14:13,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291960546] [2019-12-07 20:14:13,013 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/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 [2019-12-07 20:14:13,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 20:14:13,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:14:13,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 20:14:13,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:13,062 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:13,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:13,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:13,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:13,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1837598512] [2019-12-07 20:14:13,138 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.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:14:13,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:14:13,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2019-12-07 20:14:13,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842197443] [2019-12-07 20:14:13,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 20:14:13,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 20:14:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:14:13,139 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 18 states. [2019-12-07 20:14:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:13,351 INFO L93 Difference]: Finished difference Result 73 states and 148 transitions. [2019-12-07 20:14:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 20:14:13,352 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-12-07 20:14:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:13,353 INFO L225 Difference]: With dead ends: 73 [2019-12-07 20:14:13,353 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 20:14:13,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=336, Invalid=656, Unknown=0, NotChecked=0, Total=992 [2019-12-07 20:14:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 20:14:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2019-12-07 20:14:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 20:14:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2019-12-07 20:14:13,359 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 14 [2019-12-07 20:14:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:13,359 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2019-12-07 20:14:13,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 20:14:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2019-12-07 20:14:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:14:13,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:13,360 INFO L410 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:13,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:14:13,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:13,562 INFO L82 PathProgramCache]: Analyzing trace with hash -554702010, now seen corresponding path program 4 times [2019-12-07 20:14:13,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:13,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016266624] [2019-12-07 20:14:13,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:14:13,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016266624] [2019-12-07 20:14:13,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622433878] [2019-12-07 20:14:13,720 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/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 [2019-12-07 20:14:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:13,755 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 20:14:13,756 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:14:13,774 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:13,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:14:13,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1660173505] [2019-12-07 20:14:13,928 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.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:14:13,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:14:13,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2019-12-07 20:14:13,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154828305] [2019-12-07 20:14:13,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 20:14:13,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:13,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 20:14:13,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2019-12-07 20:14:13,929 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand 27 states. [2019-12-07 20:14:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:14,300 INFO L93 Difference]: Finished difference Result 117 states and 236 transitions. [2019-12-07 20:14:14,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 20:14:14,300 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 19 [2019-12-07 20:14:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:14,301 INFO L225 Difference]: With dead ends: 117 [2019-12-07 20:14:14,301 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 20:14:14,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=764, Invalid=1588, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 20:14:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 20:14:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2019-12-07 20:14:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 20:14:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-07 20:14:14,307 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 19 [2019-12-07 20:14:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:14,307 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-07 20:14:14,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 20:14:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-07 20:14:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 20:14:14,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:14,308 INFO L410 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:14,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:14:14,509 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:14,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 45431767, now seen corresponding path program 5 times [2019-12-07 20:14:14,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:14,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789720791] [2019-12-07 20:14:14,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:14,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789720791] [2019-12-07 20:14:14,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558334058] [2019-12-07 20:14:14,797 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/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 [2019-12-07 20:14:14,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-07 20:14:14,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:14:14,842 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 20:14:14,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:14,870 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:14,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:14,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:14:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:15,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [400363957] [2019-12-07 20:14:15,246 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.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:14:15,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:14:15,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 45 [2019-12-07 20:14:15,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076140412] [2019-12-07 20:14:15,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 20:14:15,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:15,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 20:14:15,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1608, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 20:14:15,248 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 47 states. [2019-12-07 20:14:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:16,189 INFO L93 Difference]: Finished difference Result 153 states and 308 transitions. [2019-12-07 20:14:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-07 20:14:16,189 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 30 [2019-12-07 20:14:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:16,190 INFO L225 Difference]: With dead ends: 153 [2019-12-07 20:14:16,190 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 20:14:16,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2518, Invalid=5492, Unknown=0, NotChecked=0, Total=8010 [2019-12-07 20:14:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 20:14:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2019-12-07 20:14:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 20:14:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2019-12-07 20:14:16,197 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 134 transitions. Word has length 30 [2019-12-07 20:14:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:16,197 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 134 transitions. [2019-12-07 20:14:16,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 20:14:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 134 transitions. [2019-12-07 20:14:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:14:16,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:16,198 INFO L410 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:16,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:14:16,399 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:16,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1744619877, now seen corresponding path program 6 times [2019-12-07 20:14:16,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:16,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825909290] [2019-12-07 20:14:16,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 380 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:16,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825909290] [2019-12-07 20:14:16,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465345044] [2019-12-07 20:14:16,598 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/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 [2019-12-07 20:14:16,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 20:14:16,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:14:16,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 20:14:16,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:16,664 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:16,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:14:16,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 23] imperfect sequences [23] total 24 [2019-12-07 20:14:16,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634251717] [2019-12-07 20:14:16,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 20:14:16,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:16,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 20:14:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2019-12-07 20:14:16,817 INFO L87 Difference]: Start difference. First operand 66 states and 134 transitions. Second operand 23 states. [2019-12-07 20:14:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:16,851 INFO L93 Difference]: Finished difference Result 533 states and 1018 transitions. [2019-12-07 20:14:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 20:14:16,851 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-12-07 20:14:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:16,852 INFO L225 Difference]: With dead ends: 533 [2019-12-07 20:14:16,852 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:14:16,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 20 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2019-12-07 20:14:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:14:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:14:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:14:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:14:16,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2019-12-07 20:14:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:16,853 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:14:16,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 20:14:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:14:16,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:14:17,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:14:17,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:14:17 BasicIcfg [2019-12-07 20:14:17,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:14:17,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:14:17,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:14:17,057 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:14:17,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:14:11" (3/4) ... [2019-12-07 20:14:17,060 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:14:17,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2019-12-07 20:14:17,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2019-12-07 20:14:17,068 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 20:14:17,068 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 20:14:17,069 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 20:14:17,099 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_06644470-385f-45df-aebe-ed4296a90547/bin/utaipan/witness.graphml [2019-12-07 20:14:17,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:14:17,101 INFO L168 Benchmark]: Toolchain (without parser) took 6465.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 930.8 MB in the beginning and 1.2 GB in the end (delta: -232.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:14:17,101 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:14:17,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:14:17,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:14:17,103 INFO L168 Benchmark]: Boogie Preprocessor took 18.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:14:17,103 INFO L168 Benchmark]: RCFGBuilder took 216.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:14:17,104 INFO L168 Benchmark]: TraceAbstraction took 5829.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:14:17,104 INFO L168 Benchmark]: Witness Printer took 42.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:14:17,106 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 216.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5829.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 42.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 53 ProgramPointsBefore, 16 ProgramPointsAfterwards, 51 TransitionsBefore, 14 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 380 VarBasedMoverChecksPositive, 7 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - PositiveResult [Line: 703]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: SAFE, OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 21, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 162 SDtfs, 770 SDslu, 447 SDs, 0 SdLazy, 358 SolverSat, 671 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 161 SyntacticMatches, 25 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=7, 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, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 32640 SizeOfPredicates, 40 NumberOfNonLiveVariables, 770 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 1183/1686 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...