./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longer-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_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longer-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI --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 ff437623f349039c7c835e26d53647ec95811c37 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 [2021-10-11 02:29:27,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:29:27,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:29:27,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:29:27,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:29:27,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:29:27,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:29:27,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:29:27,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:29:27,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:29:27,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:29:27,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:29:27,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:29:27,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:29:27,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:29:27,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:29:27,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:29:27,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:29:27,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:29:27,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:29:27,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:29:27,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:29:27,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:29:27,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:29:27,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:29:27,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:29:27,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:29:27,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:29:27,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:29:27,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:29:27,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:29:27,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:29:27,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:29:27,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:29:27,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:29:27,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:29:27,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:29:27,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:29:27,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:29:27,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:29:27,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:29:27,831 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:29:27,873 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:29:27,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:29:27,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:29:27,875 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:29:27,876 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:29:27,876 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:29:27,876 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:29:27,876 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:29:27,883 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:29:27,883 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:29:27,884 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:29:27,885 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:29:27,885 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:29:27,885 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:29:27,885 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:29:27,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:29:27,887 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:29:27,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:29:27,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:29:27,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:29:27,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:29:27,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:29:27,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:29:27,888 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:29:27,888 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:29:27,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:29:27,889 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:29:27,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:29:27,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:29:27,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:29:27,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:29:27,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:29:27,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:29:27,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:29:27,892 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:29:27,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:29:27,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:29:27,893 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:29:27,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:29:27,894 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI 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 -> ff437623f349039c7c835e26d53647ec95811c37 [2021-10-11 02:29:28,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:29:28,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:29:28,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:29:28,241 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:29:28,242 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:29:28,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/pthread/triangular-longer-2.i [2021-10-11 02:29:28,339 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/data/72909f888/d1ea4771bc8f414d83eb9e824e4a9de3/FLAGad8865e90 [2021-10-11 02:29:28,930 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:29:28,931 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/sv-benchmarks/c/pthread/triangular-longer-2.i [2021-10-11 02:29:28,951 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/data/72909f888/d1ea4771bc8f414d83eb9e824e4a9de3/FLAGad8865e90 [2021-10-11 02:29:29,181 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/data/72909f888/d1ea4771bc8f414d83eb9e824e4a9de3 [2021-10-11 02:29:29,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:29:29,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:29:29,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:29:29,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:29:29,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:29:29,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ebd8df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29, skipping insertion in model container [2021-10-11 02:29:29,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:29:29,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:29:29,665 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/sv-benchmarks/c/pthread/triangular-longer-2.i[30963,30976] [2021-10-11 02:29:29,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:29:29,682 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:29:29,732 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/sv-benchmarks/c/pthread/triangular-longer-2.i[30963,30976] [2021-10-11 02:29:29,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:29:29,834 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:29:29,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29 WrapperNode [2021-10-11 02:29:29,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:29:29,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:29:29,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:29:29,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:29:29,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:29:29,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:29:29,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:29:29,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:29:29,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2021-10-11 02:29:29,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:29:29,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:29:29,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:29:29,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:29:29,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:29:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-10-11 02:29:30,066 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-10-11 02:29:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-10-11 02:29:30,067 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-10-11 02:29:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:29:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 02:29:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:29:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:29:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:29:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 02:29:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:29:30,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:29:30,072 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 02:29:30,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:29:30,594 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-10-11 02:29:30,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:30 BoogieIcfgContainer [2021-10-11 02:29:30,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:29:30,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:29:30,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:29:30,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:29:30,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:29:29" (1/3) ... [2021-10-11 02:29:30,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44af708f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:29:30, skipping insertion in model container [2021-10-11 02:29:30,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (2/3) ... [2021-10-11 02:29:30,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44af708f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:29:30, skipping insertion in model container [2021-10-11 02:29:30,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:30" (3/3) ... [2021-10-11 02:29:30,617 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2021-10-11 02:29:30,639 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 02:29:30,639 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:29:30,644 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:29:30,644 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 02:29:30,686 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,686 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,687 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,687 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,687 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,687 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,688 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,688 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,688 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,689 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,689 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,690 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,691 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,691 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,691 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,692 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,693 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,693 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,695 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,695 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,696 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,696 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,696 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,697 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,698 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,699 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,699 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,699 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,700 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,700 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,700 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,701 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,701 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,702 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,702 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,702 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,702 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,703 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,703 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,703 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,704 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,704 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,704 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,705 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,705 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,705 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,706 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,706 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,706 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,707 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,707 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,708 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,708 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,708 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,708 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,709 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,711 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,712 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,712 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,712 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,713 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,713 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,721 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,721 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,721 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,722 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,722 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,722 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:30,726 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 02:29:30,739 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-10-11 02:29:30,776 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:29:30,776 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:29:30,777 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:29:30,777 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:29:30,777 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:29:30,778 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:29:30,778 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:29:30,778 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:29:30,793 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 02:29:30,796 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 130 flow [2021-10-11 02:29:30,800 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 130 flow [2021-10-11 02:29:30,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 130 flow [2021-10-11 02:29:30,876 INFO L129 PetriNetUnfolder]: 5/58 cut-off events. [2021-10-11 02:29:30,879 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 02:29:30,888 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. [2021-10-11 02:29:30,898 INFO L116 LiptonReduction]: Number of co-enabled transitions 968 [2021-10-11 02:29:32,997 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-10-11 02:29:33,178 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-10-11 02:29:33,884 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-10-11 02:29:33,999 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-10-11 02:29:34,306 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-10-11 02:29:34,445 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-10-11 02:29:34,471 INFO L131 LiptonReduction]: Checked pairs total: 998 [2021-10-11 02:29:34,473 INFO L133 LiptonReduction]: Total number of compositions: 52 [2021-10-11 02:29:34,480 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2021-10-11 02:29:34,498 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2021-10-11 02:29:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2021-10-11 02:29:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-11 02:29:34,505 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:34,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-11 02:29:34,510 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1332860337, now seen corresponding path program 1 times [2021-10-11 02:29:34,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:34,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447834295] [2021-10-11 02:29:34,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:34,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447834295] [2021-10-11 02:29:34,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:34,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:29:34,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142337886] [2021-10-11 02:29:34,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:29:34,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:29:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:29:34,879 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2021-10-11 02:29:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:34,954 INFO L93 Difference]: Finished difference Result 83 states and 212 transitions. [2021-10-11 02:29:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:29:34,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2021-10-11 02:29:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:34,968 INFO L225 Difference]: With dead ends: 83 [2021-10-11 02:29:34,968 INFO L226 Difference]: Without dead ends: 54 [2021-10-11 02:29:34,970 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 [2021-10-11 02:29:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-10-11 02:29:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2021-10-11 02:29:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-10-11 02:29:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 120 transitions. [2021-10-11 02:29:35,018 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 120 transitions. Word has length 6 [2021-10-11 02:29:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:35,019 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 120 transitions. [2021-10-11 02:29:35,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:29:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 120 transitions. [2021-10-11 02:29:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:29:35,021 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:35,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:35,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:29:35,022 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:35,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash -978539367, now seen corresponding path program 1 times [2021-10-11 02:29:35,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:35,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718945123] [2021-10-11 02:29:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:35,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718945123] [2021-10-11 02:29:35,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:35,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:29:35,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656955689] [2021-10-11 02:29:35,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:29:35,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:35,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:29:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:29:35,172 INFO L87 Difference]: Start difference. First operand 50 states and 120 transitions. Second operand 5 states. [2021-10-11 02:29:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:35,220 INFO L93 Difference]: Finished difference Result 86 states and 200 transitions. [2021-10-11 02:29:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:29:35,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2021-10-11 02:29:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:35,223 INFO L225 Difference]: With dead ends: 86 [2021-10-11 02:29:35,223 INFO L226 Difference]: Without dead ends: 78 [2021-10-11 02:29:35,223 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 [2021-10-11 02:29:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-10-11 02:29:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2021-10-11 02:29:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-10-11 02:29:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 137 transitions. [2021-10-11 02:29:35,234 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 137 transitions. Word has length 8 [2021-10-11 02:29:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:35,234 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 137 transitions. [2021-10-11 02:29:35,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:29:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 137 transitions. [2021-10-11 02:29:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:29:35,236 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:35,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:35,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:29:35,236 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:35,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:35,237 INFO L82 PathProgramCache]: Analyzing trace with hash -978459387, now seen corresponding path program 2 times [2021-10-11 02:29:35,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:35,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544036583] [2021-10-11 02:29:35,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:35,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544036583] [2021-10-11 02:29:35,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:35,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:29:35,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119737488] [2021-10-11 02:29:35,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:29:35,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:35,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:29:35,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:29:35,347 INFO L87 Difference]: Start difference. First operand 56 states and 137 transitions. Second operand 5 states. [2021-10-11 02:29:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:35,411 INFO L93 Difference]: Finished difference Result 62 states and 143 transitions. [2021-10-11 02:29:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:29:35,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2021-10-11 02:29:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:35,413 INFO L225 Difference]: With dead ends: 62 [2021-10-11 02:29:35,413 INFO L226 Difference]: Without dead ends: 50 [2021-10-11 02:29:35,414 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 [2021-10-11 02:29:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-10-11 02:29:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-10-11 02:29:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-10-11 02:29:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2021-10-11 02:29:35,420 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 8 [2021-10-11 02:29:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:35,421 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 98 transitions. [2021-10-11 02:29:35,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:29:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 98 transitions. [2021-10-11 02:29:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:29:35,422 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:35,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:35,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:29:35,423 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash -978842826, now seen corresponding path program 1 times [2021-10-11 02:29:35,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:35,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630842267] [2021-10-11 02:29:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:35,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630842267] [2021-10-11 02:29:35,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:35,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:29:35,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833476714] [2021-10-11 02:29:35,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:29:35,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:35,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:29:35,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:29:35,492 INFO L87 Difference]: Start difference. First operand 42 states and 98 transitions. Second operand 5 states. [2021-10-11 02:29:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:35,562 INFO L93 Difference]: Finished difference Result 56 states and 130 transitions. [2021-10-11 02:29:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:29:35,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2021-10-11 02:29:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:35,564 INFO L225 Difference]: With dead ends: 56 [2021-10-11 02:29:35,564 INFO L226 Difference]: Without dead ends: 50 [2021-10-11 02:29:35,565 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 [2021-10-11 02:29:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-10-11 02:29:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-10-11 02:29:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-10-11 02:29:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2021-10-11 02:29:35,571 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2021-10-11 02:29:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:35,571 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2021-10-11 02:29:35,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:29:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2021-10-11 02:29:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:29:35,572 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:35,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:35,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:29:35,573 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 220478720, now seen corresponding path program 1 times [2021-10-11 02:29:35,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:35,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042497812] [2021-10-11 02:29:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:35,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042497812] [2021-10-11 02:29:35,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:35,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:29:35,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951937909] [2021-10-11 02:29:35,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:29:35,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:35,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:29:35,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:29:35,666 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2021-10-11 02:29:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:35,754 INFO L93 Difference]: Finished difference Result 58 states and 132 transitions. [2021-10-11 02:29:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:29:35,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:29:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:35,758 INFO L225 Difference]: With dead ends: 58 [2021-10-11 02:29:35,759 INFO L226 Difference]: Without dead ends: 51 [2021-10-11 02:29:35,760 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 [2021-10-11 02:29:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-10-11 02:29:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-10-11 02:29:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-10-11 02:29:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 107 transitions. [2021-10-11 02:29:35,776 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 107 transitions. Word has length 10 [2021-10-11 02:29:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:35,776 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 107 transitions. [2021-10-11 02:29:35,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:29:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 107 transitions. [2021-10-11 02:29:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:29:35,778 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:35,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:35,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:29:35,780 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash 266866190, now seen corresponding path program 2 times [2021-10-11 02:29:35,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:35,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234008937] [2021-10-11 02:29:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:35,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234008937] [2021-10-11 02:29:35,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:35,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:29:35,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612561895] [2021-10-11 02:29:35,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:29:35,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:29:35,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:29:35,898 INFO L87 Difference]: Start difference. First operand 45 states and 107 transitions. Second operand 6 states. [2021-10-11 02:29:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:35,973 INFO L93 Difference]: Finished difference Result 78 states and 180 transitions. [2021-10-11 02:29:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:29:35,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:29:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:35,977 INFO L225 Difference]: With dead ends: 78 [2021-10-11 02:29:35,977 INFO L226 Difference]: Without dead ends: 71 [2021-10-11 02:29:35,977 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 [2021-10-11 02:29:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-11 02:29:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2021-10-11 02:29:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-10-11 02:29:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 113 transitions. [2021-10-11 02:29:35,996 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 113 transitions. Word has length 10 [2021-10-11 02:29:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:35,996 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 113 transitions. [2021-10-11 02:29:35,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:29:35,996 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 113 transitions. [2021-10-11 02:29:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:29:35,997 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:35,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:35,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:29:35,997 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:35,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:35,998 INFO L82 PathProgramCache]: Analyzing trace with hash 266888510, now seen corresponding path program 3 times [2021-10-11 02:29:35,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:35,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889094350] [2021-10-11 02:29:35,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:36,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889094350] [2021-10-11 02:29:36,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:36,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:29:36,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516125762] [2021-10-11 02:29:36,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:29:36,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:36,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:29:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:29:36,103 INFO L87 Difference]: Start difference. First operand 46 states and 113 transitions. Second operand 6 states. [2021-10-11 02:29:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:36,211 INFO L93 Difference]: Finished difference Result 54 states and 125 transitions. [2021-10-11 02:29:36,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:29:36,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:29:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:36,213 INFO L225 Difference]: With dead ends: 54 [2021-10-11 02:29:36,213 INFO L226 Difference]: Without dead ends: 43 [2021-10-11 02:29:36,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:29:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-10-11 02:29:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2021-10-11 02:29:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-10-11 02:29:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 80 transitions. [2021-10-11 02:29:36,228 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 80 transitions. Word has length 10 [2021-10-11 02:29:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:36,228 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 80 transitions. [2021-10-11 02:29:36,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:29:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 80 transitions. [2021-10-11 02:29:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:29:36,234 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:36,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:36,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:29:36,234 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash 266773190, now seen corresponding path program 4 times [2021-10-11 02:29:36,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:36,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629525021] [2021-10-11 02:29:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:36,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629525021] [2021-10-11 02:29:36,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:36,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:29:36,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184691970] [2021-10-11 02:29:36,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:29:36,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:36,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:29:36,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:29:36,325 INFO L87 Difference]: Start difference. First operand 34 states and 80 transitions. Second operand 6 states. [2021-10-11 02:29:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:36,466 INFO L93 Difference]: Finished difference Result 55 states and 129 transitions. [2021-10-11 02:29:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:29:36,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:29:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:36,467 INFO L225 Difference]: With dead ends: 55 [2021-10-11 02:29:36,467 INFO L226 Difference]: Without dead ends: 49 [2021-10-11 02:29:36,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:29:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-10-11 02:29:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2021-10-11 02:29:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2021-10-11 02:29:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2021-10-11 02:29:36,470 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 10 [2021-10-11 02:29:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:36,471 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2021-10-11 02:29:36,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:29:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2021-10-11 02:29:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:29:36,471 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:36,472 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:36,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:29:36,472 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:36,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:36,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1755209235, now seen corresponding path program 5 times [2021-10-11 02:29:36,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:36,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068403000] [2021-10-11 02:29:36,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:36,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068403000] [2021-10-11 02:29:36,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352180034] [2021-10-11 02:29:36,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:29:36,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-11 02:29:36,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:29:36,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 02:29:36,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:29:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:36,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:29:36,730 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:36,730 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:36,750 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:36,772 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:36,794 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:36,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [752507681] [2021-10-11 02:29:36,850 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) [2021-10-11 02:29:36,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:29:36,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-10-11 02:29:36,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731611042] [2021-10-11 02:29:36,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-10-11 02:29:36,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:36,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 02:29:36,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:29:36,856 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand 12 states. [2021-10-11 02:29:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:37,030 INFO L93 Difference]: Finished difference Result 71 states and 159 transitions. [2021-10-11 02:29:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:29:37,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2021-10-11 02:29:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:37,035 INFO L225 Difference]: With dead ends: 71 [2021-10-11 02:29:37,035 INFO L226 Difference]: Without dead ends: 53 [2021-10-11 02:29:37,036 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 [2021-10-11 02:29:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-10-11 02:29:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2021-10-11 02:29:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2021-10-11 02:29:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 115 transitions. [2021-10-11 02:29:37,049 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 115 transitions. Word has length 11 [2021-10-11 02:29:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:37,050 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 115 transitions. [2021-10-11 02:29:37,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-10-11 02:29:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 115 transitions. [2021-10-11 02:29:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:29:37,052 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:37,052 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:37,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-11 02:29:37,266 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:37,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash -316364261, now seen corresponding path program 6 times [2021-10-11 02:29:37,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:37,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150478804] [2021-10-11 02:29:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:37,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150478804] [2021-10-11 02:29:37,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463355261] [2021-10-11 02:29:37,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:29:37,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:29:37,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:29:37,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 02:29:37,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:29:37,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:37,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:29:37,507 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:37,507 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:37,517 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:37,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2062467296] [2021-10-11 02:29:37,569 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:29:37,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:29:37,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-10-11 02:29:37,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352194648] [2021-10-11 02:29:37,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-10-11 02:29:37,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 02:29:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:29:37,571 INFO L87 Difference]: Start difference. First operand 49 states and 115 transitions. Second operand 12 states. [2021-10-11 02:29:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:37,902 INFO L93 Difference]: Finished difference Result 89 states and 211 transitions. [2021-10-11 02:29:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-11 02:29:37,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2021-10-11 02:29:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:37,903 INFO L225 Difference]: With dead ends: 89 [2021-10-11 02:29:37,904 INFO L226 Difference]: Without dead ends: 64 [2021-10-11 02:29:37,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:29:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-11 02:29:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2021-10-11 02:29:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-10-11 02:29:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 128 transitions. [2021-10-11 02:29:37,908 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 128 transitions. Word has length 11 [2021-10-11 02:29:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:37,908 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 128 transitions. [2021-10-11 02:29:37,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-10-11 02:29:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 128 transitions. [2021-10-11 02:29:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:29:37,909 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:37,909 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:38,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-11 02:29:38,122 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:38,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1554804726, now seen corresponding path program 7 times [2021-10-11 02:29:38,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:38,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898502913] [2021-10-11 02:29:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:38,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898502913] [2021-10-11 02:29:38,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075396264] [2021-10-11 02:29:38,214 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:29:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:38,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-11 02:29:38,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:29:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:38,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:29:38,322 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:38,322 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:38,340 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:38,360 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:38,386 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:38,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1364113885] [2021-10-11 02:29:38,465 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) [2021-10-11 02:29:38,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:29:38,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-10-11 02:29:38,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072198042] [2021-10-11 02:29:38,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-10-11 02:29:38,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-11 02:29:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-10-11 02:29:38,468 INFO L87 Difference]: Start difference. First operand 54 states and 128 transitions. Second operand 16 states. [2021-10-11 02:29:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:38,922 INFO L93 Difference]: Finished difference Result 148 states and 331 transitions. [2021-10-11 02:29:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-11 02:29:38,923 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2021-10-11 02:29:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:38,924 INFO L225 Difference]: With dead ends: 148 [2021-10-11 02:29:38,924 INFO L226 Difference]: Without dead ends: 121 [2021-10-11 02:29:38,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2021-10-11 02:29:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-11 02:29:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2021-10-11 02:29:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-10-11 02:29:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 171 transitions. [2021-10-11 02:29:38,934 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 171 transitions. Word has length 14 [2021-10-11 02:29:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:38,934 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 171 transitions. [2021-10-11 02:29:38,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-10-11 02:29:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 171 transitions. [2021-10-11 02:29:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:29:38,935 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:38,935 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:39,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-10-11 02:29:39,150 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:39,150 INFO L82 PathProgramCache]: Analyzing trace with hash -867590526, now seen corresponding path program 8 times [2021-10-11 02:29:39,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:39,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853891133] [2021-10-11 02:29:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:39,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853891133] [2021-10-11 02:29:39,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428246008] [2021-10-11 02:29:39,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:29:39,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-10-11 02:29:39,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:29:39,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-11 02:29:39,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:29:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:39,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:29:39,395 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:39,395 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:39,401 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:39,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1593589267] [2021-10-11 02:29:39,477 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) [2021-10-11 02:29:39,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:29:39,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-10-11 02:29:39,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194028997] [2021-10-11 02:29:39,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-10-11 02:29:39,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:39,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-11 02:29:39,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-10-11 02:29:39,479 INFO L87 Difference]: Start difference. First operand 69 states and 171 transitions. Second operand 16 states. [2021-10-11 02:29:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:39,988 INFO L93 Difference]: Finished difference Result 153 states and 367 transitions. [2021-10-11 02:29:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-11 02:29:39,989 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2021-10-11 02:29:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:39,991 INFO L225 Difference]: With dead ends: 153 [2021-10-11 02:29:39,991 INFO L226 Difference]: Without dead ends: 105 [2021-10-11 02:29:39,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=452, Invalid=954, Unknown=0, NotChecked=0, Total=1406 [2021-10-11 02:29:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-10-11 02:29:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2021-10-11 02:29:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-10-11 02:29:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2021-10-11 02:29:40,000 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2021-10-11 02:29:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:40,001 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2021-10-11 02:29:40,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-10-11 02:29:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2021-10-11 02:29:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:29:40,001 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:40,002 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:40,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:29:40,226 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash -695615729, now seen corresponding path program 9 times [2021-10-11 02:29:40,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:40,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813628493] [2021-10-11 02:29:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:40,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813628493] [2021-10-11 02:29:40,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654268512] [2021-10-11 02:29:40,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:29:40,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:29:40,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:29:40,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-11 02:29:40,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:29:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:40,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:29:40,438 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:40,438 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:40,442 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:40,458 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:40,476 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:40,495 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:40,520 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:40,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523974370] [2021-10-11 02:29:40,603 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) [2021-10-11 02:29:40,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:29:40,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2021-10-11 02:29:40,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350784184] [2021-10-11 02:29:40,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-10-11 02:29:40,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:40,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-11 02:29:40,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-10-11 02:29:40,606 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand 22 states. [2021-10-11 02:29:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:41,239 INFO L93 Difference]: Finished difference Result 209 states and 472 transitions. [2021-10-11 02:29:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-11 02:29:41,240 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2021-10-11 02:29:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:41,242 INFO L225 Difference]: With dead ends: 209 [2021-10-11 02:29:41,242 INFO L226 Difference]: Without dead ends: 172 [2021-10-11 02:29:41,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=599, Invalid=1563, Unknown=0, NotChecked=0, Total=2162 [2021-10-11 02:29:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-10-11 02:29:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 83. [2021-10-11 02:29:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-10-11 02:29:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 212 transitions. [2021-10-11 02:29:41,249 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 212 transitions. Word has length 17 [2021-10-11 02:29:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:41,249 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 212 transitions. [2021-10-11 02:29:41,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-10-11 02:29:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 212 transitions. [2021-10-11 02:29:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:29:41,250 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:41,250 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:41,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-11 02:29:41,466 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash -759426769, now seen corresponding path program 10 times [2021-10-11 02:29:41,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:41,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788718535] [2021-10-11 02:29:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:41,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788718535] [2021-10-11 02:29:41,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85950072] [2021-10-11 02:29:41,561 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:29:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:41,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-11 02:29:41,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:29:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:41,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:29:41,672 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:41,672 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:41,728 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:29:41,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [728192325] [2021-10-11 02:29:41,869 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) [2021-10-11 02:29:41,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:29:41,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-10-11 02:29:41,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084979907] [2021-10-11 02:29:41,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-10-11 02:29:41,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:41,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-11 02:29:41,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:29:41,871 INFO L87 Difference]: Start difference. First operand 83 states and 212 transitions. Second operand 23 states. [2021-10-11 02:29:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:42,722 INFO L93 Difference]: Finished difference Result 177 states and 429 transitions. [2021-10-11 02:29:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-11 02:29:42,723 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 17 [2021-10-11 02:29:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:42,724 INFO L225 Difference]: With dead ends: 177 [2021-10-11 02:29:42,724 INFO L226 Difference]: Without dead ends: 115 [2021-10-11 02:29:42,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=964, Invalid=2116, Unknown=0, NotChecked=0, Total=3080 [2021-10-11 02:29:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-11 02:29:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 61. [2021-10-11 02:29:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2021-10-11 02:29:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 148 transitions. [2021-10-11 02:29:42,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 148 transitions. Word has length 17 [2021-10-11 02:29:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:42,729 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 148 transitions. [2021-10-11 02:29:42,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-10-11 02:29:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 148 transitions. [2021-10-11 02:29:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:29:42,729 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:42,729 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:42,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:29:42,942 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:42,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash -670224702, now seen corresponding path program 11 times [2021-10-11 02:29:42,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:42,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685862145] [2021-10-11 02:29:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:43,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685862145] [2021-10-11 02:29:43,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772807503] [2021-10-11 02:29:43,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:29:43,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-10-11 02:29:43,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:29:43,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-11 02:29:43,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:29:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:43,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:29:43,316 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:43,316 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:29:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:43,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [383499210] [2021-10-11 02:29:43,480 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) [2021-10-11 02:29:43,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:29:43,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 26 [2021-10-11 02:29:43,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649932127] [2021-10-11 02:29:43,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-10-11 02:29:43,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-11 02:29:43,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2021-10-11 02:29:43,483 INFO L87 Difference]: Start difference. First operand 61 states and 148 transitions. Second operand 28 states. [2021-10-11 02:29:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:44,748 INFO L93 Difference]: Finished difference Result 156 states and 383 transitions. [2021-10-11 02:29:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-10-11 02:29:44,749 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2021-10-11 02:29:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:44,750 INFO L225 Difference]: With dead ends: 156 [2021-10-11 02:29:44,750 INFO L226 Difference]: Without dead ends: 112 [2021-10-11 02:29:44,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1542, Invalid=3714, Unknown=0, NotChecked=0, Total=5256 [2021-10-11 02:29:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-11 02:29:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2021-10-11 02:29:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-10-11 02:29:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 191 transitions. [2021-10-11 02:29:44,755 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 191 transitions. Word has length 24 [2021-10-11 02:29:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:44,756 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 191 transitions. [2021-10-11 02:29:44,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-10-11 02:29:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 191 transitions. [2021-10-11 02:29:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 02:29:44,757 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:44,757 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:44,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-11 02:29:44,974 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash 780243396, now seen corresponding path program 12 times [2021-10-11 02:29:44,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:44,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415216779] [2021-10-11 02:29:44,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:29:45,004 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:29:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:29:45,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:29:45,072 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:29:45,072 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:29:45,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 02:29:45,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:29:45 BasicIcfg [2021-10-11 02:29:45,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:29:45,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:29:45,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:29:45,171 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:29:45,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:30" (3/4) ... [2021-10-11 02:29:45,174 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:29:45,274 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f83a981f-cfdc-4b9b-9f25-a8eddeb2c7c7/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:29:45,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:29:45,276 INFO L168 Benchmark]: Toolchain (without parser) took 16089.82 ms. Allocated memory was 109.1 MB in the beginning and 297.8 MB in the end (delta: 188.7 MB). Free memory was 78.7 MB in the beginning and 177.5 MB in the end (delta: -98.8 MB). Peak memory consumption was 89.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:45,276 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 109.1 MB. Free memory is still 67.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:29:45,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.47 ms. Allocated memory is still 109.1 MB. Free memory was 78.4 MB in the beginning and 65.4 MB in the end (delta: 12.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:45,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.15 ms. Allocated memory is still 109.1 MB. Free memory was 65.4 MB in the beginning and 63.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:45,277 INFO L168 Benchmark]: Boogie Preprocessor took 63.92 ms. Allocated memory is still 109.1 MB. Free memory was 63.6 MB in the beginning and 62.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:45,278 INFO L168 Benchmark]: RCFGBuilder took 624.17 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 62.0 MB in the beginning and 106.6 MB in the end (delta: -44.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:45,278 INFO L168 Benchmark]: TraceAbstraction took 14561.65 ms. Allocated memory was 132.1 MB in the beginning and 297.8 MB in the end (delta: 165.7 MB). Free memory was 106.0 MB in the beginning and 185.9 MB in the end (delta: -79.9 MB). Peak memory consumption was 85.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:45,279 INFO L168 Benchmark]: Witness Printer took 103.62 ms. Allocated memory is still 297.8 MB. Free memory was 185.9 MB in the beginning and 177.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:45,281 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.28 ms. Allocated memory is still 109.1 MB. Free memory is still 67.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 649.47 ms. Allocated memory is still 109.1 MB. Free memory was 78.4 MB in the beginning and 65.4 MB in the end (delta: 12.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.15 ms. Allocated memory is still 109.1 MB. Free memory was 65.4 MB in the beginning and 63.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.92 ms. Allocated memory is still 109.1 MB. Free memory was 63.6 MB in the beginning and 62.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 624.17 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 62.0 MB in the beginning and 106.6 MB in the end (delta: -44.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14561.65 ms. Allocated memory was 132.1 MB in the beginning and 297.8 MB in the end (delta: 165.7 MB). Free memory was 106.0 MB in the beginning and 185.9 MB in the end (delta: -79.9 MB). Peak memory consumption was 85.3 MB. Max. memory is 16.1 GB. * Witness Printer took 103.62 ms. Allocated memory is still 297.8 MB. Free memory was 185.9 MB in the beginning and 177.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 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.2s, 20 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.6s, 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*10 +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 < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 10 [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 < 10 [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 < 10 [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 < 10 [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=5, k=4] [L704] COND TRUE 2 k < 10 [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 < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 [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 < 10 [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 < 10 [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 < 10 [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=7, k=8] [L704] COND TRUE 2 k < 10 [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 < 10 [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=8, k=9] [L704] COND TRUE 2 k < 10 [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 < 10 [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 < 10 [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] [L719] 0 int condJ = j >= (2*10 +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=25, j=26, k=10, k=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.2s, OverallIterations: 16, TraceHistogramMax: 10, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 227 SDtfs, 1120 SDslu, 801 SDs, 0 SdLazy, 952 SolverSat, 692 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3642 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 374 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 314 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 20799 SizeOfPredicates, 48 NumberOfNonLiveVariables, 815 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 12/312 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...