./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash faf61a04ec090f6b1743a12583eb9c9759e6ed3e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 20:25:32,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 20:25:32,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 20:25:32,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 20:25:32,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 20:25:32,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 20:25:32,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 20:25:32,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 20:25:32,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 20:25:32,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 20:25:32,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 20:25:32,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 20:25:32,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 20:25:32,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 20:25:32,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 20:25:32,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 20:25:32,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 20:25:32,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 20:25:32,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 20:25:32,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 20:25:32,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 20:25:32,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 20:25:32,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 20:25:32,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 20:25:32,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 20:25:32,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 20:25:32,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 20:25:32,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 20:25:32,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 20:25:32,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 20:25:32,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 20:25:32,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 20:25:32,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 20:25:32,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 20:25:32,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 20:25:32,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 20:25:32,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 20:25:32,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 20:25:32,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 20:25:32,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 20:25:32,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 20:25:32,875 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 20:25:32,892 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 20:25:32,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 20:25:32,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 20:25:32,893 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 20:25:32,893 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 20:25:32,893 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 20:25:32,893 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 20:25:32,894 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 20:25:32,894 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 20:25:32,894 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 20:25:32,894 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 20:25:32,894 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 20:25:32,894 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 20:25:32,894 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 20:25:32,894 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 20:25:32,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 20:25:32,895 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 20:25:32,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 20:25:32,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 20:25:32,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 20:25:32,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 20:25:32,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 20:25:32,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 20:25:32,896 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 20:25:32,896 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 20:25:32,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 20:25:32,896 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 20:25:32,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 20:25:32,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 20:25:32,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 20:25:32,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:25:32,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 20:25:32,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 20:25:32,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 20:25:32,897 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 20:25:32,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 20:25:32,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 20:25:32,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 20:25:32,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 20:25:32,898 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> faf61a04ec090f6b1743a12583eb9c9759e6ed3e [2020-12-09 20:25:33,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 20:25:33,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 20:25:33,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 20:25:33,113 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 20:25:33,114 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 20:25:33,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longest-2.i [2020-12-09 20:25:33,155 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/data/dda0b7d5d/86140fd1f02e42b8a005e5e2d399866e/FLAG35579d46d [2020-12-09 20:25:33,544 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 20:25:33,544 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/sv-benchmarks/c/pthread/triangular-longest-2.i [2020-12-09 20:25:33,557 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/data/dda0b7d5d/86140fd1f02e42b8a005e5e2d399866e/FLAG35579d46d [2020-12-09 20:25:33,566 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/data/dda0b7d5d/86140fd1f02e42b8a005e5e2d399866e [2020-12-09 20:25:33,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 20:25:33,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 20:25:33,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 20:25:33,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 20:25:33,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 20:25:33,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671758c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33, skipping insertion in model container [2020-12-09 20:25:33,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 20:25:33,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 20:25:33,800 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2020-12-09 20:25:33,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:25:33,808 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 20:25:33,837 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2020-12-09 20:25:33,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:25:33,894 INFO L208 MainTranslator]: Completed translation [2020-12-09 20:25:33,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33 WrapperNode [2020-12-09 20:25:33,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 20:25:33,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 20:25:33,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 20:25:33,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 20:25:33,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 20:25:33,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 20:25:33,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 20:25:33,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 20:25:33,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... [2020-12-09 20:25:33,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 20:25:33,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 20:25:33,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 20:25:33,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 20:25:33,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:25:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-12-09 20:25:34,003 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-12-09 20:25:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-12-09 20:25:34,003 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-12-09 20:25:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 20:25:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 20:25:34,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 20:25:34,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 20:25:34,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 20:25:34,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 20:25:34,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 20:25:34,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 20:25:34,005 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 20:25:34,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 20:25:34,245 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-09 20:25:34,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:25:34 BoogieIcfgContainer [2020-12-09 20:25:34,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 20:25:34,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 20:25:34,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 20:25:34,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 20:25:34,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:25:33" (1/3) ... [2020-12-09 20:25:34,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666059e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:25:34, skipping insertion in model container [2020-12-09 20:25:34,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:25:33" (2/3) ... [2020-12-09 20:25:34,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666059e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:25:34, skipping insertion in model container [2020-12-09 20:25:34,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:25:34" (3/3) ... [2020-12-09 20:25:34,254 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2020-12-09 20:25:34,263 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 20:25:34,263 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 20:25:34,265 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 20:25:34,266 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 20:25:34,288 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,288 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,288 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,288 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,289 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,289 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,289 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,289 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,289 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,289 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,290 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,290 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,290 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,290 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,291 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,291 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,291 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,291 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,291 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,291 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,292 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,292 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,292 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,292 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,292 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,293 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,293 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,293 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,293 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,293 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,294 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,294 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,294 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,294 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,294 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,294 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,295 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,295 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,295 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,295 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,295 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,295 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,295 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,295 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,296 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,296 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,296 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,296 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,296 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,296 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,296 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,296 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,297 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,297 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,297 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,297 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,299 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,299 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,299 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,299 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,299 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,299 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,304 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,304 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,304 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,304 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,304 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,305 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 20:25:34,306 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 20:25:34,314 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-12-09 20:25:34,330 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 20:25:34,330 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 20:25:34,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 20:25:34,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 20:25:34,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 20:25:34,331 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 20:25:34,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 20:25:34,331 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 20:25:34,341 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 20:25:34,342 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 130 flow [2020-12-09 20:25:34,344 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 130 flow [2020-12-09 20:25:34,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 130 flow [2020-12-09 20:25:34,376 INFO L129 PetriNetUnfolder]: 5/58 cut-off events. [2020-12-09 20:25:34,376 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 20:25:34,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 58 events. 5/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2020-12-09 20:25:34,383 INFO L116 LiptonReduction]: Number of co-enabled transitions 968 [2020-12-09 20:25:35,992 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-09 20:25:36,231 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-09 20:25:36,335 INFO L131 LiptonReduction]: Checked pairs total: 998 [2020-12-09 20:25:36,335 INFO L133 LiptonReduction]: Total number of compositions: 52 [2020-12-09 20:25:36,339 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-12-09 20:25:36,345 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-12-09 20:25:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-12-09 20:25:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 20:25:36,349 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:36,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 20:25:36,350 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1332860337, now seen corresponding path program 1 times [2020-12-09 20:25:36,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:36,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92580033] [2020-12-09 20:25:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:36,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92580033] [2020-12-09 20:25:36,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:36,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 20:25:36,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343566560] [2020-12-09 20:25:36,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:25:36,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:36,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:25:36,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:25:36,515 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-12-09 20:25:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:36,552 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2020-12-09 20:25:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 20:25:36,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 20:25:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:36,562 INFO L225 Difference]: With dead ends: 59 [2020-12-09 20:25:36,562 INFO L226 Difference]: Without dead ends: 38 [2020-12-09 20:25:36,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:25:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-09 20:25:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-09 20:25:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 20:25:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2020-12-09 20:25:36,589 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 92 transitions. Word has length 6 [2020-12-09 20:25:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:36,589 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 92 transitions. [2020-12-09 20:25:36,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:25:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 92 transitions. [2020-12-09 20:25:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:25:36,590 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:36,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:36,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 20:25:36,590 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash -978539367, now seen corresponding path program 1 times [2020-12-09 20:25:36,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:36,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016993956] [2020-12-09 20:25:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:36,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016993956] [2020-12-09 20:25:36,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:36,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:25:36,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155295444] [2020-12-09 20:25:36,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:25:36,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:36,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:25:36,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:25:36,670 INFO L87 Difference]: Start difference. First operand 38 states and 92 transitions. Second operand 5 states. [2020-12-09 20:25:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:36,694 INFO L93 Difference]: Finished difference Result 82 states and 192 transitions. [2020-12-09 20:25:36,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 20:25:36,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 20:25:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:36,695 INFO L225 Difference]: With dead ends: 82 [2020-12-09 20:25:36,695 INFO L226 Difference]: Without dead ends: 74 [2020-12-09 20:25:36,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:25:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-09 20:25:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2020-12-09 20:25:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 20:25:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 129 transitions. [2020-12-09 20:25:36,703 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 129 transitions. Word has length 8 [2020-12-09 20:25:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:36,703 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 129 transitions. [2020-12-09 20:25:36,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:25:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 129 transitions. [2020-12-09 20:25:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:25:36,704 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:36,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:36,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 20:25:36,704 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:36,705 INFO L82 PathProgramCache]: Analyzing trace with hash -978459387, now seen corresponding path program 2 times [2020-12-09 20:25:36,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:36,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5391012] [2020-12-09 20:25:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:36,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5391012] [2020-12-09 20:25:36,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:36,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:25:36,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225735080] [2020-12-09 20:25:36,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:25:36,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:25:36,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:25:36,757 INFO L87 Difference]: Start difference. First operand 52 states and 129 transitions. Second operand 5 states. [2020-12-09 20:25:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:36,788 INFO L93 Difference]: Finished difference Result 62 states and 143 transitions. [2020-12-09 20:25:36,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:25:36,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 20:25:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:36,789 INFO L225 Difference]: With dead ends: 62 [2020-12-09 20:25:36,789 INFO L226 Difference]: Without dead ends: 50 [2020-12-09 20:25:36,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 20:25:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-09 20:25:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-12-09 20:25:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-09 20:25:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2020-12-09 20:25:36,794 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2020-12-09 20:25:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:36,795 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2020-12-09 20:25:36,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:25:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2020-12-09 20:25:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:25:36,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:36,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:36,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 20:25:36,796 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:36,796 INFO L82 PathProgramCache]: Analyzing trace with hash 220478720, now seen corresponding path program 1 times [2020-12-09 20:25:36,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:36,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284818974] [2020-12-09 20:25:36,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:36,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284818974] [2020-12-09 20:25:36,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:36,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:25:36,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225549202] [2020-12-09 20:25:36,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:25:36,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:36,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:25:36,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:25:36,849 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2020-12-09 20:25:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:36,896 INFO L93 Difference]: Finished difference Result 58 states and 132 transitions. [2020-12-09 20:25:36,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:25:36,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:25:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:36,897 INFO L225 Difference]: With dead ends: 58 [2020-12-09 20:25:36,897 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 20:25:36,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 20:25:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 20:25:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-12-09 20:25:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 20:25:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 107 transitions. [2020-12-09 20:25:36,904 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 107 transitions. Word has length 10 [2020-12-09 20:25:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:36,904 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 107 transitions. [2020-12-09 20:25:36,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:25:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 107 transitions. [2020-12-09 20:25:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:25:36,905 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:36,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:36,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 20:25:36,905 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash 266866190, now seen corresponding path program 2 times [2020-12-09 20:25:36,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:36,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868978750] [2020-12-09 20:25:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:36,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868978750] [2020-12-09 20:25:36,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:36,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:25:36,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185137482] [2020-12-09 20:25:36,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:25:36,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:36,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:25:36,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:25:36,964 INFO L87 Difference]: Start difference. First operand 45 states and 107 transitions. Second operand 6 states. [2020-12-09 20:25:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:37,007 INFO L93 Difference]: Finished difference Result 78 states and 180 transitions. [2020-12-09 20:25:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 20:25:37,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:25:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:37,008 INFO L225 Difference]: With dead ends: 78 [2020-12-09 20:25:37,008 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 20:25:37,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 20:25:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 20:25:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-12-09 20:25:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 20:25:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 113 transitions. [2020-12-09 20:25:37,013 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 113 transitions. Word has length 10 [2020-12-09 20:25:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:37,013 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 113 transitions. [2020-12-09 20:25:37,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:25:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 113 transitions. [2020-12-09 20:25:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:25:37,014 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:37,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:37,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 20:25:37,014 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash 266888510, now seen corresponding path program 3 times [2020-12-09 20:25:37,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:37,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383773216] [2020-12-09 20:25:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:37,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383773216] [2020-12-09 20:25:37,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:37,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:25:37,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308041933] [2020-12-09 20:25:37,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:25:37,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:37,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:25:37,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:25:37,056 INFO L87 Difference]: Start difference. First operand 46 states and 113 transitions. Second operand 6 states. [2020-12-09 20:25:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:37,121 INFO L93 Difference]: Finished difference Result 58 states and 137 transitions. [2020-12-09 20:25:37,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 20:25:37,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 20:25:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:37,122 INFO L225 Difference]: With dead ends: 58 [2020-12-09 20:25:37,122 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 20:25:37,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-09 20:25:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 20:25:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2020-12-09 20:25:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-09 20:25:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2020-12-09 20:25:37,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 82 transitions. Word has length 10 [2020-12-09 20:25:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:37,125 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 82 transitions. [2020-12-09 20:25:37,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:25:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 82 transitions. [2020-12-09 20:25:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 20:25:37,125 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:37,126 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:37,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 20:25:37,126 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:37,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:37,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1755209235, now seen corresponding path program 4 times [2020-12-09 20:25:37,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:37,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756846258] [2020-12-09 20:25:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:37,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756846258] [2020-12-09 20:25:37,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110622411] [2020-12-09 20:25:37,173 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:37,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 20:25:37,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:37,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:37,282 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:37,283 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:37,297 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:37,312 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:37,326 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:37,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356149779] [2020-12-09 20:25:37,355 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:37,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:37,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2020-12-09 20:25:37,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770596676] [2020-12-09 20:25:37,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 20:25:37,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:37,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 20:25:37,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-09 20:25:37,357 INFO L87 Difference]: Start difference. First operand 34 states and 82 transitions. Second operand 12 states. [2020-12-09 20:25:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:37,452 INFO L93 Difference]: Finished difference Result 70 states and 157 transitions. [2020-12-09 20:25:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 20:25:37,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-12-09 20:25:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:37,453 INFO L225 Difference]: With dead ends: 70 [2020-12-09 20:25:37,453 INFO L226 Difference]: Without dead ends: 52 [2020-12-09 20:25:37,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2020-12-09 20:25:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-09 20:25:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2020-12-09 20:25:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 20:25:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 113 transitions. [2020-12-09 20:25:37,458 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 113 transitions. Word has length 11 [2020-12-09 20:25:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:37,458 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 113 transitions. [2020-12-09 20:25:37,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 20:25:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 113 transitions. [2020-12-09 20:25:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 20:25:37,458 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:37,458 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:37,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-09 20:25:37,660 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:37,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash -319965345, now seen corresponding path program 5 times [2020-12-09 20:25:37,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:37,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548424530] [2020-12-09 20:25:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:37,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548424530] [2020-12-09 20:25:37,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465230957] [2020-12-09 20:25:37,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:37,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 20:25:37,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:25:37,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 20:25:37,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:37,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:37,885 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:37,885 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:37,896 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:37,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2042952509] [2020-12-09 20:25:37,943 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:37,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:37,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2020-12-09 20:25:37,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926595086] [2020-12-09 20:25:37,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 20:25:37,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:37,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 20:25:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-09 20:25:37,944 INFO L87 Difference]: Start difference. First operand 48 states and 113 transitions. Second operand 12 states. [2020-12-09 20:25:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:38,149 INFO L93 Difference]: Finished difference Result 111 states and 257 transitions. [2020-12-09 20:25:38,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 20:25:38,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-12-09 20:25:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:38,151 INFO L225 Difference]: With dead ends: 111 [2020-12-09 20:25:38,151 INFO L226 Difference]: Without dead ends: 84 [2020-12-09 20:25:38,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2020-12-09 20:25:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-12-09 20:25:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2020-12-09 20:25:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 20:25:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 137 transitions. [2020-12-09 20:25:38,157 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 137 transitions. Word has length 11 [2020-12-09 20:25:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:38,157 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 137 transitions. [2020-12-09 20:25:38,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 20:25:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 137 transitions. [2020-12-09 20:25:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 20:25:38,158 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:38,158 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:38,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:38,359 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1426667684, now seen corresponding path program 6 times [2020-12-09 20:25:38,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:38,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977658986] [2020-12-09 20:25:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:38,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977658986] [2020-12-09 20:25:38,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739488127] [2020-12-09 20:25:38,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:38,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:25:38,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:25:38,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 20:25:38,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:38,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:38,716 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:38,716 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:38,730 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:38,743 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:38,758 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:38,777 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:38,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1499744222] [2020-12-09 20:25:38,799 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:38,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:38,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2020-12-09 20:25:38,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426572639] [2020-12-09 20:25:38,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 20:25:38,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 20:25:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-12-09 20:25:38,801 INFO L87 Difference]: Start difference. First operand 55 states and 137 transitions. Second operand 15 states. [2020-12-09 20:25:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:38,944 INFO L93 Difference]: Finished difference Result 93 states and 213 transitions. [2020-12-09 20:25:38,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 20:25:38,944 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-12-09 20:25:38,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:38,945 INFO L225 Difference]: With dead ends: 93 [2020-12-09 20:25:38,945 INFO L226 Difference]: Without dead ends: 74 [2020-12-09 20:25:38,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2020-12-09 20:25:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-09 20:25:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2020-12-09 20:25:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 20:25:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 143 transitions. [2020-12-09 20:25:38,951 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 143 transitions. Word has length 12 [2020-12-09 20:25:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:38,951 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 143 transitions. [2020-12-09 20:25:38,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 20:25:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 143 transitions. [2020-12-09 20:25:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 20:25:38,952 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:38,952 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:39,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:39,154 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:39,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613902, now seen corresponding path program 7 times [2020-12-09 20:25:39,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:39,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498034616] [2020-12-09 20:25:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:39,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498034616] [2020-12-09 20:25:39,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272251553] [2020-12-09 20:25:39,256 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:39,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 20:25:39,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:39,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:39,307 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:39,307 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:39,317 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:39,328 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:39,339 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:39,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1955232391] [2020-12-09 20:25:39,368 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:39,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:39,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2020-12-09 20:25:39,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300787747] [2020-12-09 20:25:39,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 20:25:39,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 20:25:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-12-09 20:25:39,374 INFO L87 Difference]: Start difference. First operand 58 states and 143 transitions. Second operand 14 states. [2020-12-09 20:25:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:39,549 INFO L93 Difference]: Finished difference Result 137 states and 309 transitions. [2020-12-09 20:25:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 20:25:39,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2020-12-09 20:25:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:39,550 INFO L225 Difference]: With dead ends: 137 [2020-12-09 20:25:39,551 INFO L226 Difference]: Without dead ends: 118 [2020-12-09 20:25:39,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2020-12-09 20:25:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-09 20:25:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 58. [2020-12-09 20:25:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 20:25:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 149 transitions. [2020-12-09 20:25:39,557 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 149 transitions. Word has length 12 [2020-12-09 20:25:39,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:39,557 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 149 transitions. [2020-12-09 20:25:39,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 20:25:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 149 transitions. [2020-12-09 20:25:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 20:25:39,558 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:39,558 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:39,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:39,760 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1217334822, now seen corresponding path program 8 times [2020-12-09 20:25:39,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:39,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003698052] [2020-12-09 20:25:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:39,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003698052] [2020-12-09 20:25:39,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13681244] [2020-12-09 20:25:39,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:39,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 20:25:39,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:25:39,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 20:25:39,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:39,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:39,953 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:39,953 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:39,973 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:40,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1495708274] [2020-12-09 20:25:40,015 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:40,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:40,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2020-12-09 20:25:40,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897215687] [2020-12-09 20:25:40,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 20:25:40,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 20:25:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-12-09 20:25:40,017 INFO L87 Difference]: Start difference. First operand 58 states and 149 transitions. Second operand 15 states. [2020-12-09 20:25:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:40,277 INFO L93 Difference]: Finished difference Result 119 states and 281 transitions. [2020-12-09 20:25:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 20:25:40,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-12-09 20:25:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:40,278 INFO L225 Difference]: With dead ends: 119 [2020-12-09 20:25:40,278 INFO L226 Difference]: Without dead ends: 83 [2020-12-09 20:25:40,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2020-12-09 20:25:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-09 20:25:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 53. [2020-12-09 20:25:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 20:25:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 128 transitions. [2020-12-09 20:25:40,281 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 128 transitions. Word has length 12 [2020-12-09 20:25:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:40,282 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 128 transitions. [2020-12-09 20:25:40,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 20:25:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 128 transitions. [2020-12-09 20:25:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 20:25:40,282 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:40,282 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:40,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-09 20:25:40,484 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1385885646, now seen corresponding path program 9 times [2020-12-09 20:25:40,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:40,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267467253] [2020-12-09 20:25:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:40,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267467253] [2020-12-09 20:25:40,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304499918] [2020-12-09 20:25:40,587 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:40,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:25:40,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:25:40,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 20:25:40,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:40,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:25:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:40,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:40,669 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:40,669 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:40,688 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:40,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2146196811] [2020-12-09 20:25:40,774 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:40,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:40,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2020-12-09 20:25:40,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053021913] [2020-12-09 20:25:40,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 20:25:40,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:40,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 20:25:40,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2020-12-09 20:25:40,776 INFO L87 Difference]: Start difference. First operand 53 states and 128 transitions. Second operand 23 states. [2020-12-09 20:25:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:41,288 INFO L93 Difference]: Finished difference Result 150 states and 363 transitions. [2020-12-09 20:25:41,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-12-09 20:25:41,288 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2020-12-09 20:25:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:41,289 INFO L225 Difference]: With dead ends: 150 [2020-12-09 20:25:41,289 INFO L226 Difference]: Without dead ends: 93 [2020-12-09 20:25:41,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2020-12-09 20:25:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-12-09 20:25:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 66. [2020-12-09 20:25:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-09 20:25:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 161 transitions. [2020-12-09 20:25:41,293 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 161 transitions. Word has length 16 [2020-12-09 20:25:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:41,293 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 161 transitions. [2020-12-09 20:25:41,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 20:25:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 161 transitions. [2020-12-09 20:25:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 20:25:41,294 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:41,294 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:41,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:41,495 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash -985011240, now seen corresponding path program 10 times [2020-12-09 20:25:41,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:41,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100424064] [2020-12-09 20:25:41,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:41,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100424064] [2020-12-09 20:25:41,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788588139] [2020-12-09 20:25:41,722 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:41,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 20:25:41,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:41,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:41,816 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:41,817 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,835 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,850 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,866 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,881 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,897 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,913 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,929 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,945 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,964 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,980 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:41,998 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:42,015 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:42,032 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:42,050 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:42,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [70024758] [2020-12-09 20:25:42,083 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:42,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:42,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2020-12-09 20:25:42,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991337962] [2020-12-09 20:25:42,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-09 20:25:42,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:42,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-09 20:25:42,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 20:25:42,085 INFO L87 Difference]: Start difference. First operand 66 states and 161 transitions. Second operand 35 states. [2020-12-09 20:25:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:42,738 INFO L93 Difference]: Finished difference Result 163 states and 356 transitions. [2020-12-09 20:25:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-12-09 20:25:42,739 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 22 [2020-12-09 20:25:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:42,739 INFO L225 Difference]: With dead ends: 163 [2020-12-09 20:25:42,740 INFO L226 Difference]: Without dead ends: 114 [2020-12-09 20:25:42,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1265, Invalid=2895, Unknown=0, NotChecked=0, Total=4160 [2020-12-09 20:25:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-09 20:25:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2020-12-09 20:25:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-09 20:25:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 194 transitions. [2020-12-09 20:25:42,743 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 194 transitions. Word has length 22 [2020-12-09 20:25:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:42,744 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 194 transitions. [2020-12-09 20:25:42,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-09 20:25:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 194 transitions. [2020-12-09 20:25:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 20:25:42,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:42,744 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:42,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:42,946 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1090086938, now seen corresponding path program 11 times [2020-12-09 20:25:42,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:42,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734699975] [2020-12-09 20:25:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:43,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734699975] [2020-12-09 20:25:43,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404518789] [2020-12-09 20:25:43,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:43,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-12-09 20:25:43,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:25:43,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 20:25:43,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:43,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:43,185 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:43,185 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,200 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,218 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,236 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,252 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,270 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,288 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,306 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,324 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,341 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,362 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,381 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,400 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,419 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:43,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1717230580] [2020-12-09 20:25:43,472 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:43,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:43,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2020-12-09 20:25:43,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968090334] [2020-12-09 20:25:43,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-09 20:25:43,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:43,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-09 20:25:43,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 20:25:43,474 INFO L87 Difference]: Start difference. First operand 82 states and 194 transitions. Second operand 34 states. [2020-12-09 20:25:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:44,039 INFO L93 Difference]: Finished difference Result 238 states and 509 transitions. [2020-12-09 20:25:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-09 20:25:44,039 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2020-12-09 20:25:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:44,040 INFO L225 Difference]: With dead ends: 238 [2020-12-09 20:25:44,040 INFO L226 Difference]: Without dead ends: 189 [2020-12-09 20:25:44,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1293, Invalid=3129, Unknown=0, NotChecked=0, Total=4422 [2020-12-09 20:25:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-09 20:25:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 85. [2020-12-09 20:25:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-09 20:25:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 203 transitions. [2020-12-09 20:25:44,045 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 203 transitions. Word has length 22 [2020-12-09 20:25:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:44,045 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 203 transitions. [2020-12-09 20:25:44,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-09 20:25:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 203 transitions. [2020-12-09 20:25:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 20:25:44,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:44,046 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:44,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-09 20:25:44,247 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash -825842986, now seen corresponding path program 12 times [2020-12-09 20:25:44,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:44,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245265834] [2020-12-09 20:25:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:44,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245265834] [2020-12-09 20:25:44,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956399654] [2020-12-09 20:25:44,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:44,449 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:25:44,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:25:44,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 20:25:44,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:44,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:44,474 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:44,475 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,488 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,502 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,520 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,534 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,550 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,566 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,582 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,599 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,615 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:44,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1447340567] [2020-12-09 20:25:44,722 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:44,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:44,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2020-12-09 20:25:44,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202203637] [2020-12-09 20:25:44,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-09 20:25:44,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:44,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-09 20:25:44,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 20:25:44,723 INFO L87 Difference]: Start difference. First operand 85 states and 203 transitions. Second operand 34 states. [2020-12-09 20:25:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:45,515 INFO L93 Difference]: Finished difference Result 242 states and 525 transitions. [2020-12-09 20:25:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-12-09 20:25:45,516 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2020-12-09 20:25:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:45,517 INFO L225 Difference]: With dead ends: 242 [2020-12-09 20:25:45,517 INFO L226 Difference]: Without dead ends: 191 [2020-12-09 20:25:45,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1487, Invalid=4063, Unknown=0, NotChecked=0, Total=5550 [2020-12-09 20:25:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-09 20:25:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 94. [2020-12-09 20:25:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-12-09 20:25:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 229 transitions. [2020-12-09 20:25:45,521 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 229 transitions. Word has length 22 [2020-12-09 20:25:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:45,522 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 229 transitions. [2020-12-09 20:25:45,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-09 20:25:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 229 transitions. [2020-12-09 20:25:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 20:25:45,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:45,522 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:45,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-09 20:25:45,724 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 382967990, now seen corresponding path program 13 times [2020-12-09 20:25:45,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:45,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990825669] [2020-12-09 20:25:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:45,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990825669] [2020-12-09 20:25:45,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238039216] [2020-12-09 20:25:45,864 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:45,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 20:25:45,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:45,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:45,934 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:45,934 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:45,946 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:46,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [592827906] [2020-12-09 20:25:46,156 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:46,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:46,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2020-12-09 20:25:46,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942931914] [2020-12-09 20:25:46,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-09 20:25:46,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:46,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-09 20:25:46,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 20:25:46,157 INFO L87 Difference]: Start difference. First operand 94 states and 229 transitions. Second operand 34 states. [2020-12-09 20:25:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:47,316 INFO L93 Difference]: Finished difference Result 302 states and 711 transitions. [2020-12-09 20:25:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-12-09 20:25:47,316 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2020-12-09 20:25:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:47,317 INFO L225 Difference]: With dead ends: 302 [2020-12-09 20:25:47,317 INFO L226 Difference]: Without dead ends: 203 [2020-12-09 20:25:47,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2499, Invalid=5691, Unknown=0, NotChecked=0, Total=8190 [2020-12-09 20:25:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-12-09 20:25:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 96. [2020-12-09 20:25:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-12-09 20:25:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 240 transitions. [2020-12-09 20:25:47,323 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 240 transitions. Word has length 22 [2020-12-09 20:25:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:47,323 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 240 transitions. [2020-12-09 20:25:47,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-09 20:25:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 240 transitions. [2020-12-09 20:25:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 20:25:47,324 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:47,324 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:47,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-09 20:25:47,526 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:47,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1762907359, now seen corresponding path program 14 times [2020-12-09 20:25:47,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:47,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783236524] [2020-12-09 20:25:47,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:47,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783236524] [2020-12-09 20:25:47,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945750501] [2020-12-09 20:25:47,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:47,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2020-12-09 20:25:47,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:25:47,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-09 20:25:47,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:47,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:47,920 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:47,920 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:47,953 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:48,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1178710307] [2020-12-09 20:25:48,497 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:48,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:48,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 59 [2020-12-09 20:25:48,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076613122] [2020-12-09 20:25:48,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 61 states [2020-12-09 20:25:48,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:48,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2020-12-09 20:25:48,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=856, Invalid=2804, Unknown=0, NotChecked=0, Total=3660 [2020-12-09 20:25:48,500 INFO L87 Difference]: Start difference. First operand 96 states and 240 transitions. Second operand 61 states. [2020-12-09 20:25:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:50,770 INFO L93 Difference]: Finished difference Result 304 states and 737 transitions. [2020-12-09 20:25:50,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-12-09 20:25:50,770 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 35 [2020-12-09 20:25:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:50,771 INFO L225 Difference]: With dead ends: 304 [2020-12-09 20:25:50,772 INFO L226 Difference]: Without dead ends: 206 [2020-12-09 20:25:50,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6138, Invalid=14454, Unknown=0, NotChecked=0, Total=20592 [2020-12-09 20:25:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-12-09 20:25:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 117. [2020-12-09 20:25:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-12-09 20:25:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 287 transitions. [2020-12-09 20:25:50,780 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 287 transitions. Word has length 35 [2020-12-09 20:25:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:50,780 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 287 transitions. [2020-12-09 20:25:50,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2020-12-09 20:25:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 287 transitions. [2020-12-09 20:25:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 20:25:50,780 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:50,780 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:50,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-09 20:25:50,981 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2024056099, now seen corresponding path program 15 times [2020-12-09 20:25:50,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:50,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685477892] [2020-12-09 20:25:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:51,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685477892] [2020-12-09 20:25:51,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236122447] [2020-12-09 20:25:51,533 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:25:51,590 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:25:51,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:25:51,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-09 20:25:51,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:51,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:25:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:51,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:25:51,686 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 20:25:51,686 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:51,690 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 20:25:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:51,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [460541673] [2020-12-09 20:25:51,764 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:25:51,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:25:51,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 43 [2020-12-09 20:25:51,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127011122] [2020-12-09 20:25:51,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-12-09 20:25:51,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:25:51,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-12-09 20:25:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2020-12-09 20:25:51,766 INFO L87 Difference]: Start difference. First operand 117 states and 287 transitions. Second operand 45 states. [2020-12-09 20:25:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:53,886 INFO L93 Difference]: Finished difference Result 204 states and 503 transitions. [2020-12-09 20:25:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-12-09 20:25:53,886 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 47 [2020-12-09 20:25:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:53,887 INFO L225 Difference]: With dead ends: 204 [2020-12-09 20:25:53,887 INFO L226 Difference]: Without dead ends: 199 [2020-12-09 20:25:53,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4582, Invalid=10180, Unknown=0, NotChecked=0, Total=14762 [2020-12-09 20:25:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-09 20:25:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 157. [2020-12-09 20:25:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-09 20:25:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 407 transitions. [2020-12-09 20:25:53,891 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 407 transitions. Word has length 47 [2020-12-09 20:25:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:53,892 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 407 transitions. [2020-12-09 20:25:53,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-12-09 20:25:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 407 transitions. [2020-12-09 20:25:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-09 20:25:53,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:53,892 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:54,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-09 20:25:54,093 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:25:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash 988526380, now seen corresponding path program 16 times [2020-12-09 20:25:54,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:25:54,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820857839] [2020-12-09 20:25:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:25:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 20:25:54,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 20:25:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 20:25:54,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 20:25:54,155 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 20:25:54,155 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 20:25:54,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-09 20:25:54,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:25:54 BasicIcfg [2020-12-09 20:25:54,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 20:25:54,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 20:25:54,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 20:25:54,220 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 20:25:54,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:25:34" (3/4) ... [2020-12-09 20:25:54,222 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 20:25:54,292 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b9532bec-345c-45ef-b22e-057dbf0317fb/bin/utaipan/witness.graphml [2020-12-09 20:25:54,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 20:25:54,293 INFO L168 Benchmark]: Toolchain (without parser) took 20724.01 ms. Allocated memory was 94.4 MB in the beginning and 163.6 MB in the end (delta: 69.2 MB). Free memory was 71.2 MB in the beginning and 131.1 MB in the end (delta: -59.9 MB). Peak memory consumption was 98.9 MB. Max. memory is 16.1 GB. [2020-12-09 20:25:54,294 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 67.1 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:25:54,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.11 ms. Allocated memory is still 94.4 MB. Free memory was 70.9 MB in the beginning and 64.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 16.1 GB. [2020-12-09 20:25:54,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.89 ms. Allocated memory is still 94.4 MB. Free memory was 64.3 MB in the beginning and 62.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:25:54,295 INFO L168 Benchmark]: Boogie Preprocessor took 18.42 ms. Allocated memory is still 94.4 MB. Free memory was 62.3 MB in the beginning and 61.4 MB in the end (delta: 948.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:25:54,295 INFO L168 Benchmark]: RCFGBuilder took 304.40 ms. Allocated memory is still 94.4 MB. Free memory was 61.4 MB in the beginning and 54.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 20:25:54,296 INFO L168 Benchmark]: TraceAbstraction took 19971.60 ms. Allocated memory was 94.4 MB in the beginning and 163.6 MB in the end (delta: 69.2 MB). Free memory was 54.7 MB in the beginning and 51.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 73.4 MB. Max. memory is 16.1 GB. [2020-12-09 20:25:54,296 INFO L168 Benchmark]: Witness Printer took 72.04 ms. Allocated memory is still 163.6 MB. Free memory was 51.6 MB in the beginning and 131.1 MB in the end (delta: -79.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 20:25:54,298 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 67.1 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 325.11 ms. Allocated memory is still 94.4 MB. Free memory was 70.9 MB in the beginning and 64.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 27.89 ms. Allocated memory is still 94.4 MB. Free memory was 64.3 MB in the beginning and 62.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.42 ms. Allocated memory is still 94.4 MB. Free memory was 62.3 MB in the beginning and 61.4 MB in the end (delta: 948.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 304.40 ms. Allocated memory is still 94.4 MB. Free memory was 61.4 MB in the beginning and 54.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19971.60 ms. Allocated memory was 94.4 MB in the beginning and 163.6 MB in the end (delta: 69.2 MB). Free memory was 54.7 MB in the beginning and 51.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 73.4 MB. Max. memory is 16.1 GB. * Witness Printer took 72.04 ms. Allocated memory is still 163.6 MB. Free memory was 51.6 MB in the beginning and 131.1 MB in the end (delta: -79.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 645 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 20 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 20 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.9s, 62 PlacesBefore, 20 PlacesAfterwards, 60 TransitionsBefore, 16 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 52 TotalNumberOfCompositions, 998 MoverChecksTotal - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L716] 0 int condI = i >= (2*20 +6); VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=3, k=2] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=5] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=8, k=7] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=9, k=8] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=10] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=11, k=10] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=14, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=16, k=15] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=19, k=18] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=20, k=19] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 int condJ = j >= (2*20 +6); [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.8s, OverallIterations: 19, TraceHistogramMax: 20, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 256 SDtfs, 2786 SDslu, 1347 SDs, 0 SdLazy, 1713 SolverSat, 2371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 760 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17977 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=18, 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, 18 MinimizatonAttempts, 706 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 71762 SizeOfPredicates, 155 NumberOfNonLiveVariables, 1700 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 42 InterpolantComputations, 6 PerfectInterpolantSequences, 0/2154 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...