./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39b1d1b4e66a0abfa95038a0cc46f8d2c84b1027 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-a4ecdab [2020-11-22 12:56:29,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-22 12:56:29,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-22 12:56:29,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-22 12:56:29,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-22 12:56:29,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-22 12:56:29,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-22 12:56:29,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-22 12:56:29,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-22 12:56:29,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-22 12:56:29,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-22 12:56:29,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-22 12:56:29,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-22 12:56:29,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-22 12:56:29,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-22 12:56:29,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-22 12:56:29,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-22 12:56:29,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-22 12:56:29,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-22 12:56:29,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-22 12:56:29,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-22 12:56:29,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-22 12:56:29,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-22 12:56:29,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-22 12:56:30,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-22 12:56:30,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-22 12:56:30,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-22 12:56:30,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-22 12:56:30,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-22 12:56:30,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-22 12:56:30,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-22 12:56:30,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-22 12:56:30,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-22 12:56:30,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-22 12:56:30,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-22 12:56:30,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-22 12:56:30,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-22 12:56:30,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-22 12:56:30,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-22 12:56:30,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-22 12:56:30,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-22 12:56:30,028 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-22 12:56:30,055 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-22 12:56:30,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-22 12:56:30,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-22 12:56:30,060 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-22 12:56:30,060 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-22 12:56:30,060 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-22 12:56:30,060 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-22 12:56:30,060 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-22 12:56:30,061 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-22 12:56:30,061 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-22 12:56:30,062 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-22 12:56:30,062 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-22 12:56:30,062 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-22 12:56:30,063 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-22 12:56:30,063 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-22 12:56:30,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-22 12:56:30,064 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-22 12:56:30,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-22 12:56:30,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-22 12:56:30,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-22 12:56:30,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-22 12:56:30,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-22 12:56:30,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-22 12:56:30,065 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-22 12:56:30,065 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-22 12:56:30,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-22 12:56:30,066 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-22 12:56:30,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-22 12:56:30,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-22 12:56:30,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-22 12:56:30,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-22 12:56:30,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 12:56:30,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-22 12:56:30,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-22 12:56:30,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-22 12:56:30,069 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-22 12:56:30,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-22 12:56:30,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-22 12:56:30,070 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-22 12:56:30,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-22 12:56:30,070 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39b1d1b4e66a0abfa95038a0cc46f8d2c84b1027 [2020-11-22 12:56:30,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-22 12:56:30,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-22 12:56:30,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-22 12:56:30,386 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-22 12:56:30,386 INFO L275 PluginConnector]: CDTParser initialized [2020-11-22 12:56:30,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix057_pso.opt.i [2020-11-22 12:56:30,453 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/data/3f2fdbf4a/ae4ebefd6827450480c48db6b127c430/FLAG508dac95e [2020-11-22 12:56:30,969 INFO L306 CDTParser]: Found 1 translation units. [2020-11-22 12:56:30,970 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/sv-benchmarks/c/pthread-wmm/mix057_pso.opt.i [2020-11-22 12:56:30,996 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/data/3f2fdbf4a/ae4ebefd6827450480c48db6b127c430/FLAG508dac95e [2020-11-22 12:56:31,289 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/data/3f2fdbf4a/ae4ebefd6827450480c48db6b127c430 [2020-11-22 12:56:31,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-22 12:56:31,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-22 12:56:31,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-22 12:56:31,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-22 12:56:31,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-22 12:56:31,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:31,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d97e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31, skipping insertion in model container [2020-11-22 12:56:31,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:31,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-22 12:56:31,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-22 12:56:31,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:56:31,771 INFO L203 MainTranslator]: Completed pre-run [2020-11-22 12:56:31,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:56:31,935 INFO L208 MainTranslator]: Completed translation [2020-11-22 12:56:31,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31 WrapperNode [2020-11-22 12:56:31,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-22 12:56:31,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-22 12:56:31,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-22 12:56:31,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-22 12:56:31,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:31,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:32,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-22 12:56:32,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-22 12:56:32,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-22 12:56:32,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-22 12:56:32,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:32,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:32,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:32,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:32,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:32,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:32,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... [2020-11-22 12:56:32,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-22 12:56:32,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-22 12:56:32,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-22 12:56:32,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-22 12:56:32,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 12:56:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-22 12:56:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-22 12:56:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-22 12:56:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-22 12:56:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-22 12:56:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-22 12:56:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-22 12:56:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-22 12:56:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-22 12:56:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-22 12:56:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-22 12:56:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-22 12:56:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-22 12:56:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-22 12:56:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-22 12:56:32,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-22 12:56:32,191 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-22 12:56:34,571 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-22 12:56:34,571 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-22 12:56:34,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:56:34 BoogieIcfgContainer [2020-11-22 12:56:34,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-22 12:56:34,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-22 12:56:34,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-22 12:56:34,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-22 12:56:34,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:56:31" (1/3) ... [2020-11-22 12:56:34,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64989fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:56:34, skipping insertion in model container [2020-11-22 12:56:34,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:31" (2/3) ... [2020-11-22 12:56:34,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64989fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:56:34, skipping insertion in model container [2020-11-22 12:56:34,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:56:34" (3/3) ... [2020-11-22 12:56:34,583 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2020-11-22 12:56:34,597 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-22 12:56:34,597 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-22 12:56:34,602 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-22 12:56:34,603 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-22 12:56:34,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,646 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,646 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,647 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,647 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,648 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,650 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,650 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,654 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,657 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,665 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,666 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,667 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,673 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,673 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:56:34,682 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-22 12:56:34,694 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-22 12:56:34,725 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-22 12:56:34,726 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-22 12:56:34,726 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-22 12:56:34,726 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-22 12:56:34,726 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-22 12:56:34,726 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-22 12:56:34,727 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-22 12:56:34,727 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-22 12:56:34,744 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-22 12:56:34,745 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-22 12:56:34,754 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-22 12:56:34,756 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-11-22 12:56:34,822 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-11-22 12:56:34,822 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-22 12:56:34,827 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-22 12:56:34,834 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-22 12:56:34,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:56:34,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:35,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:56:35,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:35,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:35,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:35,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:35,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:35,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:35,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:35,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:35,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:35,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:56:35,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:36,044 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-22 12:56:36,156 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-22 12:56:36,379 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-22 12:56:36,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:36,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:36,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:36,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:36,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:36,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:36,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:36,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:36,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:56:36,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:36,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:56:36,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:36,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:56:36,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:56:36,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:56:36,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:56:36,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:56:36,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:36,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:56:36,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:36,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:56:36,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:56:36,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:56:36,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:56:36,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:56:36,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:36,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:56:36,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:36,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:56:36,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:56:36,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:56:36,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:56:36,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:56:36,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:36,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:56:36,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:36,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:56:36,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:56:36,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:56:36,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:56:37,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:37,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:37,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:37,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:37,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:37,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:37,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:37,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:37,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:37,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:37,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:37,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:37,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:56:37,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:56:37,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:37,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:37,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-22 12:56:37,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:37,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:37,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:39,167 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-22 12:56:39,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-22 12:56:39,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:39,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-22 12:56:39,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:56:40,377 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-11-22 12:56:40,995 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-22 12:56:41,390 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-22 12:56:41,945 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-22 12:56:42,165 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-22 12:56:42,181 INFO L131 LiptonReduction]: Checked pairs total: 6442 [2020-11-22 12:56:42,181 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-11-22 12:56:42,188 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-11-22 12:56:42,434 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-11-22 12:56:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-11-22 12:56:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-22 12:56:42,444 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:42,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:42,446 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:42,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:42,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1604801105, now seen corresponding path program 1 times [2020-11-22 12:56:42,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:42,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633569605] [2020-11-22 12:56:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:42,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633569605] [2020-11-22 12:56:42,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:42,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 12:56:42,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890616265] [2020-11-22 12:56:42,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 12:56:42,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:42,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 12:56:42,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 12:56:42,784 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-11-22 12:56:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:42,952 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-11-22 12:56:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 12:56:42,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-22 12:56:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:43,007 INFO L225 Difference]: With dead ends: 2602 [2020-11-22 12:56:43,007 INFO L226 Difference]: Without dead ends: 2202 [2020-11-22 12:56:43,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 12:56:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-11-22 12:56:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-11-22 12:56:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-11-22 12:56:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-11-22 12:56:43,204 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-11-22 12:56:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:43,205 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-11-22 12:56:43,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 12:56:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-11-22 12:56:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-22 12:56:43,216 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:43,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:43,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-22 12:56:43,218 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:43,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1351042416, now seen corresponding path program 1 times [2020-11-22 12:56:43,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:43,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458267952] [2020-11-22 12:56:43,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:43,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458267952] [2020-11-22 12:56:43,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:43,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:56:43,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974003145] [2020-11-22 12:56:43,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:56:43,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:56:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:43,503 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 5 states. [2020-11-22 12:56:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:43,658 INFO L93 Difference]: Finished difference Result 2582 states and 9578 transitions. [2020-11-22 12:56:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:56:43,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-22 12:56:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:43,691 INFO L225 Difference]: With dead ends: 2582 [2020-11-22 12:56:43,691 INFO L226 Difference]: Without dead ends: 2182 [2020-11-22 12:56:43,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2020-11-22 12:56:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2020-11-22 12:56:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2020-11-22 12:56:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 8328 transitions. [2020-11-22 12:56:43,847 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 8328 transitions. Word has length 12 [2020-11-22 12:56:43,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:43,848 INFO L481 AbstractCegarLoop]: Abstraction has 2182 states and 8328 transitions. [2020-11-22 12:56:43,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:56:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 8328 transitions. [2020-11-22 12:56:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 12:56:43,850 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:43,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:43,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-22 12:56:43,851 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:43,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:43,861 INFO L82 PathProgramCache]: Analyzing trace with hash -156942098, now seen corresponding path program 1 times [2020-11-22 12:56:43,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:43,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243910197] [2020-11-22 12:56:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:43,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243910197] [2020-11-22 12:56:43,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:43,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:56:43,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962900604] [2020-11-22 12:56:43,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:56:43,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:43,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:56:43,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:56:43,994 INFO L87 Difference]: Start difference. First operand 2182 states and 8328 transitions. Second operand 4 states. [2020-11-22 12:56:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:44,130 INFO L93 Difference]: Finished difference Result 2520 states and 9338 transitions. [2020-11-22 12:56:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:56:44,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-22 12:56:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:44,154 INFO L225 Difference]: With dead ends: 2520 [2020-11-22 12:56:44,154 INFO L226 Difference]: Without dead ends: 2170 [2020-11-22 12:56:44,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2020-11-22 12:56:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2020-11-22 12:56:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-11-22 12:56:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 8272 transitions. [2020-11-22 12:56:44,251 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 8272 transitions. Word has length 13 [2020-11-22 12:56:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:44,251 INFO L481 AbstractCegarLoop]: Abstraction has 2170 states and 8272 transitions. [2020-11-22 12:56:44,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:56:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 8272 transitions. [2020-11-22 12:56:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 12:56:44,253 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:44,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:44,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-22 12:56:44,254 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1067393042, now seen corresponding path program 1 times [2020-11-22 12:56:44,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:44,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430437659] [2020-11-22 12:56:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:44,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430437659] [2020-11-22 12:56:44,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:44,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:56:44,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216891264] [2020-11-22 12:56:44,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:56:44,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:44,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:56:44,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:44,445 INFO L87 Difference]: Start difference. First operand 2170 states and 8272 transitions. Second operand 5 states. [2020-11-22 12:56:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:44,590 INFO L93 Difference]: Finished difference Result 2410 states and 8924 transitions. [2020-11-22 12:56:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:56:44,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-22 12:56:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:44,613 INFO L225 Difference]: With dead ends: 2410 [2020-11-22 12:56:44,613 INFO L226 Difference]: Without dead ends: 2090 [2020-11-22 12:56:44,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:56:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-11-22 12:56:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2020-11-22 12:56:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-11-22 12:56:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7908 transitions. [2020-11-22 12:56:44,705 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7908 transitions. Word has length 13 [2020-11-22 12:56:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:44,705 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7908 transitions. [2020-11-22 12:56:44,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:56:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7908 transitions. [2020-11-22 12:56:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 12:56:44,708 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:44,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:44,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-22 12:56:44,708 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash 984029452, now seen corresponding path program 1 times [2020-11-22 12:56:44,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:44,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123799723] [2020-11-22 12:56:44,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:44,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123799723] [2020-11-22 12:56:44,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:44,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:56:44,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755683679] [2020-11-22 12:56:44,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:56:44,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:44,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:56:44,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:56:44,811 INFO L87 Difference]: Start difference. First operand 2090 states and 7908 transitions. Second operand 4 states. [2020-11-22 12:56:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:44,878 INFO L93 Difference]: Finished difference Result 3298 states and 11938 transitions. [2020-11-22 12:56:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:56:44,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-22 12:56:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:44,904 INFO L225 Difference]: With dead ends: 3298 [2020-11-22 12:56:44,904 INFO L226 Difference]: Without dead ends: 2394 [2020-11-22 12:56:44,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2020-11-22 12:56:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2074. [2020-11-22 12:56:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2020-11-22 12:56:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 7536 transitions. [2020-11-22 12:56:44,998 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 7536 transitions. Word has length 14 [2020-11-22 12:56:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:44,998 INFO L481 AbstractCegarLoop]: Abstraction has 2074 states and 7536 transitions. [2020-11-22 12:56:44,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:56:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 7536 transitions. [2020-11-22 12:56:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 12:56:45,001 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:45,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:45,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-22 12:56:45,002 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash -570272720, now seen corresponding path program 1 times [2020-11-22 12:56:45,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:45,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630319852] [2020-11-22 12:56:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:45,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630319852] [2020-11-22 12:56:45,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:45,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:56:45,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108756383] [2020-11-22 12:56:45,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:56:45,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:45,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:56:45,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:45,114 INFO L87 Difference]: Start difference. First operand 2074 states and 7536 transitions. Second operand 5 states. [2020-11-22 12:56:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:45,203 INFO L93 Difference]: Finished difference Result 2242 states and 7958 transitions. [2020-11-22 12:56:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:56:45,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-22 12:56:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:45,249 INFO L225 Difference]: With dead ends: 2242 [2020-11-22 12:56:45,249 INFO L226 Difference]: Without dead ends: 1962 [2020-11-22 12:56:45,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-11-22 12:56:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-11-22 12:56:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-11-22 12:56:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7100 transitions. [2020-11-22 12:56:45,326 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7100 transitions. Word has length 14 [2020-11-22 12:56:45,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:45,326 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7100 transitions. [2020-11-22 12:56:45,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:56:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7100 transitions. [2020-11-22 12:56:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 12:56:45,329 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:45,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:45,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-22 12:56:45,329 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash -570278486, now seen corresponding path program 1 times [2020-11-22 12:56:45,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:45,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522456908] [2020-11-22 12:56:45,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:45,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522456908] [2020-11-22 12:56:45,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:45,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:56:45,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746792322] [2020-11-22 12:56:45,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:56:45,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:45,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:56:45,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:45,455 INFO L87 Difference]: Start difference. First operand 1962 states and 7100 transitions. Second operand 5 states. [2020-11-22 12:56:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:45,560 INFO L93 Difference]: Finished difference Result 2214 states and 7824 transitions. [2020-11-22 12:56:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:56:45,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-22 12:56:45,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:45,588 INFO L225 Difference]: With dead ends: 2214 [2020-11-22 12:56:45,589 INFO L226 Difference]: Without dead ends: 1934 [2020-11-22 12:56:45,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2020-11-22 12:56:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2020-11-22 12:56:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2020-11-22 12:56:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 6976 transitions. [2020-11-22 12:56:45,663 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 6976 transitions. Word has length 14 [2020-11-22 12:56:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:45,663 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 6976 transitions. [2020-11-22 12:56:45,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:56:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 6976 transitions. [2020-11-22 12:56:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 12:56:45,666 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:45,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:45,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-22 12:56:45,667 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:45,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:45,667 INFO L82 PathProgramCache]: Analyzing trace with hash -498625880, now seen corresponding path program 1 times [2020-11-22 12:56:45,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:45,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814874470] [2020-11-22 12:56:45,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:45,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814874470] [2020-11-22 12:56:45,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:45,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:56:45,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955717732] [2020-11-22 12:56:45,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:56:45,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:45,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:56:45,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:45,805 INFO L87 Difference]: Start difference. First operand 1934 states and 6976 transitions. Second operand 6 states. [2020-11-22 12:56:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:45,912 INFO L93 Difference]: Finished difference Result 2102 states and 7412 transitions. [2020-11-22 12:56:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:56:45,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-22 12:56:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:45,922 INFO L225 Difference]: With dead ends: 2102 [2020-11-22 12:56:45,922 INFO L226 Difference]: Without dead ends: 1878 [2020-11-22 12:56:45,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:56:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2020-11-22 12:56:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2020-11-22 12:56:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1878 states. [2020-11-22 12:56:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 6728 transitions. [2020-11-22 12:56:46,004 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 6728 transitions. Word has length 15 [2020-11-22 12:56:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:46,005 INFO L481 AbstractCegarLoop]: Abstraction has 1878 states and 6728 transitions. [2020-11-22 12:56:46,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:56:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 6728 transitions. [2020-11-22 12:56:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 12:56:46,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:46,039 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:46,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-22 12:56:46,040 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:46,040 INFO L82 PathProgramCache]: Analyzing trace with hash -498850754, now seen corresponding path program 1 times [2020-11-22 12:56:46,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:46,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235422999] [2020-11-22 12:56:46,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:46,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235422999] [2020-11-22 12:56:46,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:46,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:56:46,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406885197] [2020-11-22 12:56:46,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:56:46,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:46,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:56:46,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:46,164 INFO L87 Difference]: Start difference. First operand 1878 states and 6728 transitions. Second operand 5 states. [2020-11-22 12:56:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:46,269 INFO L93 Difference]: Finished difference Result 2104 states and 7402 transitions. [2020-11-22 12:56:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:56:46,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-22 12:56:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:46,279 INFO L225 Difference]: With dead ends: 2104 [2020-11-22 12:56:46,280 INFO L226 Difference]: Without dead ends: 1894 [2020-11-22 12:56:46,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2020-11-22 12:56:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2020-11-22 12:56:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2020-11-22 12:56:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 6780 transitions. [2020-11-22 12:56:46,368 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 6780 transitions. Word has length 15 [2020-11-22 12:56:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:46,369 INFO L481 AbstractCegarLoop]: Abstraction has 1894 states and 6780 transitions. [2020-11-22 12:56:46,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:56:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 6780 transitions. [2020-11-22 12:56:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 12:56:46,375 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:46,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:46,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-22 12:56:46,375 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash -503924834, now seen corresponding path program 2 times [2020-11-22 12:56:46,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:46,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768054648] [2020-11-22 12:56:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:46,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768054648] [2020-11-22 12:56:46,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:46,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:56:46,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840660619] [2020-11-22 12:56:46,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:56:46,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:46,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:56:46,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:46,503 INFO L87 Difference]: Start difference. First operand 1894 states and 6780 transitions. Second operand 6 states. [2020-11-22 12:56:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:46,668 INFO L93 Difference]: Finished difference Result 2076 states and 7278 transitions. [2020-11-22 12:56:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:56:46,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-22 12:56:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:46,678 INFO L225 Difference]: With dead ends: 2076 [2020-11-22 12:56:46,678 INFO L226 Difference]: Without dead ends: 1866 [2020-11-22 12:56:46,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:56:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2020-11-22 12:56:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1850. [2020-11-22 12:56:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2020-11-22 12:56:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 6604 transitions. [2020-11-22 12:56:46,762 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 6604 transitions. Word has length 15 [2020-11-22 12:56:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:46,763 INFO L481 AbstractCegarLoop]: Abstraction has 1850 states and 6604 transitions. [2020-11-22 12:56:46,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:56:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 6604 transitions. [2020-11-22 12:56:46,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 12:56:46,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:46,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:46,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-22 12:56:46,767 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:46,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1722380032, now seen corresponding path program 1 times [2020-11-22 12:56:46,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:46,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601525779] [2020-11-22 12:56:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:46,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601525779] [2020-11-22 12:56:46,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:46,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:56:46,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063112205] [2020-11-22 12:56:46,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:56:46,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:46,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:56:46,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:46,868 INFO L87 Difference]: Start difference. First operand 1850 states and 6604 transitions. Second operand 6 states. [2020-11-22 12:56:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:47,015 INFO L93 Difference]: Finished difference Result 2142 states and 7492 transitions. [2020-11-22 12:56:47,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:56:47,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-22 12:56:47,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:47,025 INFO L225 Difference]: With dead ends: 2142 [2020-11-22 12:56:47,025 INFO L226 Difference]: Without dead ends: 1946 [2020-11-22 12:56:47,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:56:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-11-22 12:56:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1890. [2020-11-22 12:56:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2020-11-22 12:56:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 6684 transitions. [2020-11-22 12:56:47,098 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 6684 transitions. Word has length 16 [2020-11-22 12:56:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:47,099 INFO L481 AbstractCegarLoop]: Abstraction has 1890 states and 6684 transitions. [2020-11-22 12:56:47,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:56:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 6684 transitions. [2020-11-22 12:56:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 12:56:47,103 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:47,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:47,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-22 12:56:47,103 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1715409899, now seen corresponding path program 1 times [2020-11-22 12:56:47,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:47,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869421075] [2020-11-22 12:56:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:47,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869421075] [2020-11-22 12:56:47,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:47,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:56:47,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516012378] [2020-11-22 12:56:47,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:56:47,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:56:47,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:47,227 INFO L87 Difference]: Start difference. First operand 1890 states and 6684 transitions. Second operand 6 states. [2020-11-22 12:56:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:47,321 INFO L93 Difference]: Finished difference Result 2078 states and 7234 transitions. [2020-11-22 12:56:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:56:47,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-22 12:56:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:47,329 INFO L225 Difference]: With dead ends: 2078 [2020-11-22 12:56:47,329 INFO L226 Difference]: Without dead ends: 1938 [2020-11-22 12:56:47,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:56:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2020-11-22 12:56:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2020-11-22 12:56:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2020-11-22 12:56:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 6824 transitions. [2020-11-22 12:56:47,420 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 6824 transitions. Word has length 16 [2020-11-22 12:56:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:47,420 INFO L481 AbstractCegarLoop]: Abstraction has 1938 states and 6824 transitions. [2020-11-22 12:56:47,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:56:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 6824 transitions. [2020-11-22 12:56:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 12:56:47,424 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:47,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:47,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-22 12:56:47,424 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:47,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:47,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1558113419, now seen corresponding path program 2 times [2020-11-22 12:56:47,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:47,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616630186] [2020-11-22 12:56:47,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:47,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616630186] [2020-11-22 12:56:47,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:47,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:56:47,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289907043] [2020-11-22 12:56:47,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 12:56:47,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 12:56:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:56:47,562 INFO L87 Difference]: Start difference. First operand 1938 states and 6824 transitions. Second operand 7 states. [2020-11-22 12:56:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:47,713 INFO L93 Difference]: Finished difference Result 2022 states and 7014 transitions. [2020-11-22 12:56:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:56:47,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-22 12:56:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:47,728 INFO L225 Difference]: With dead ends: 2022 [2020-11-22 12:56:47,728 INFO L226 Difference]: Without dead ends: 1882 [2020-11-22 12:56:47,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-22 12:56:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-11-22 12:56:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1834. [2020-11-22 12:56:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2020-11-22 12:56:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 6464 transitions. [2020-11-22 12:56:47,793 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 6464 transitions. Word has length 16 [2020-11-22 12:56:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:47,793 INFO L481 AbstractCegarLoop]: Abstraction has 1834 states and 6464 transitions. [2020-11-22 12:56:47,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 12:56:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 6464 transitions. [2020-11-22 12:56:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-22 12:56:47,797 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:47,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:47,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-22 12:56:47,798 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1817459975, now seen corresponding path program 1 times [2020-11-22 12:56:47,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:47,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670597097] [2020-11-22 12:56:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:47,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670597097] [2020-11-22 12:56:47,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:47,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:56:47,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458323553] [2020-11-22 12:56:47,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:56:47,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:47,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:56:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:56:47,860 INFO L87 Difference]: Start difference. First operand 1834 states and 6464 transitions. Second operand 4 states. [2020-11-22 12:56:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:47,914 INFO L93 Difference]: Finished difference Result 1890 states and 6063 transitions. [2020-11-22 12:56:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:56:47,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-22 12:56:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:47,920 INFO L225 Difference]: With dead ends: 1890 [2020-11-22 12:56:47,920 INFO L226 Difference]: Without dead ends: 1458 [2020-11-22 12:56:47,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-11-22 12:56:47,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2020-11-22 12:56:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2020-11-22 12:56:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 4662 transitions. [2020-11-22 12:56:47,967 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 4662 transitions. Word has length 17 [2020-11-22 12:56:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:47,967 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 4662 transitions. [2020-11-22 12:56:47,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:56:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 4662 transitions. [2020-11-22 12:56:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-22 12:56:47,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:47,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:47,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-22 12:56:47,971 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:47,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:47,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1047833445, now seen corresponding path program 1 times [2020-11-22 12:56:47,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:47,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425245192] [2020-11-22 12:56:47,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:48,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425245192] [2020-11-22 12:56:48,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:48,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:56:48,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205520252] [2020-11-22 12:56:48,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:56:48,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:56:48,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:48,059 INFO L87 Difference]: Start difference. First operand 1458 states and 4662 transitions. Second operand 5 states. [2020-11-22 12:56:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:48,129 INFO L93 Difference]: Finished difference Result 1227 states and 3554 transitions. [2020-11-22 12:56:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:56:48,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-22 12:56:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:48,138 INFO L225 Difference]: With dead ends: 1227 [2020-11-22 12:56:48,138 INFO L226 Difference]: Without dead ends: 948 [2020-11-22 12:56:48,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-11-22 12:56:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2020-11-22 12:56:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2020-11-22 12:56:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2696 transitions. [2020-11-22 12:56:48,168 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2696 transitions. Word has length 18 [2020-11-22 12:56:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:48,168 INFO L481 AbstractCegarLoop]: Abstraction has 948 states and 2696 transitions. [2020-11-22 12:56:48,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:56:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2696 transitions. [2020-11-22 12:56:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 12:56:48,171 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:48,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:48,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-22 12:56:48,171 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1687389071, now seen corresponding path program 1 times [2020-11-22 12:56:48,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:48,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260736296] [2020-11-22 12:56:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:48,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260736296] [2020-11-22 12:56:48,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:48,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:56:48,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727805910] [2020-11-22 12:56:48,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:56:48,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:56:48,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:56:48,236 INFO L87 Difference]: Start difference. First operand 948 states and 2696 transitions. Second operand 4 states. [2020-11-22 12:56:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:48,276 INFO L93 Difference]: Finished difference Result 1387 states and 3769 transitions. [2020-11-22 12:56:48,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:56:48,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-22 12:56:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:48,279 INFO L225 Difference]: With dead ends: 1387 [2020-11-22 12:56:48,279 INFO L226 Difference]: Without dead ends: 968 [2020-11-22 12:56:48,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2020-11-22 12:56:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 928. [2020-11-22 12:56:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2020-11-22 12:56:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 2501 transitions. [2020-11-22 12:56:48,305 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 2501 transitions. Word has length 20 [2020-11-22 12:56:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:48,306 INFO L481 AbstractCegarLoop]: Abstraction has 928 states and 2501 transitions. [2020-11-22 12:56:48,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:56:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 2501 transitions. [2020-11-22 12:56:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 12:56:48,311 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:48,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:48,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-22 12:56:48,311 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:48,312 INFO L82 PathProgramCache]: Analyzing trace with hash 219006172, now seen corresponding path program 1 times [2020-11-22 12:56:48,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:48,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031510772] [2020-11-22 12:56:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:48,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031510772] [2020-11-22 12:56:48,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:48,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:56:48,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936892212] [2020-11-22 12:56:48,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:56:48,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:48,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:56:48,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:56:48,404 INFO L87 Difference]: Start difference. First operand 928 states and 2501 transitions. Second operand 6 states. [2020-11-22 12:56:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:48,481 INFO L93 Difference]: Finished difference Result 782 states and 2050 transitions. [2020-11-22 12:56:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:56:48,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-22 12:56:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:48,483 INFO L225 Difference]: With dead ends: 782 [2020-11-22 12:56:48,484 INFO L226 Difference]: Without dead ends: 630 [2020-11-22 12:56:48,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:56:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-11-22 12:56:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 610. [2020-11-22 12:56:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-11-22 12:56:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1577 transitions. [2020-11-22 12:56:48,501 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1577 transitions. Word has length 20 [2020-11-22 12:56:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:48,502 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 1577 transitions. [2020-11-22 12:56:48,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:56:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1577 transitions. [2020-11-22 12:56:48,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-22 12:56:48,504 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:48,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:48,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-22 12:56:48,505 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 961159876, now seen corresponding path program 1 times [2020-11-22 12:56:48,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:48,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344102566] [2020-11-22 12:56:48,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:48,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344102566] [2020-11-22 12:56:48,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:48,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:56:48,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226055135] [2020-11-22 12:56:48,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:56:48,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:48,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:56:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:56:48,577 INFO L87 Difference]: Start difference. First operand 610 states and 1577 transitions. Second operand 5 states. [2020-11-22 12:56:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:48,623 INFO L93 Difference]: Finished difference Result 828 states and 2075 transitions. [2020-11-22 12:56:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:56:48,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-11-22 12:56:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:48,625 INFO L225 Difference]: With dead ends: 828 [2020-11-22 12:56:48,625 INFO L226 Difference]: Without dead ends: 486 [2020-11-22 12:56:48,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:56:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-11-22 12:56:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 480. [2020-11-22 12:56:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-11-22 12:56:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1128 transitions. [2020-11-22 12:56:48,652 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1128 transitions. Word has length 23 [2020-11-22 12:56:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:48,653 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 1128 transitions. [2020-11-22 12:56:48,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:56:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1128 transitions. [2020-11-22 12:56:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-22 12:56:48,654 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:48,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:48,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-22 12:56:48,655 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1284568559, now seen corresponding path program 1 times [2020-11-22 12:56:48,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:48,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978574636] [2020-11-22 12:56:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:48,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978574636] [2020-11-22 12:56:48,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:48,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:56:48,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596401396] [2020-11-22 12:56:48,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 12:56:48,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 12:56:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:56:48,843 INFO L87 Difference]: Start difference. First operand 480 states and 1128 transitions. Second operand 7 states. [2020-11-22 12:56:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:49,030 INFO L93 Difference]: Finished difference Result 588 states and 1339 transitions. [2020-11-22 12:56:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 12:56:49,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-22 12:56:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:49,032 INFO L225 Difference]: With dead ends: 588 [2020-11-22 12:56:49,032 INFO L226 Difference]: Without dead ends: 312 [2020-11-22 12:56:49,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-22 12:56:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-11-22 12:56:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2020-11-22 12:56:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-11-22 12:56:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 665 transitions. [2020-11-22 12:56:49,040 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 665 transitions. Word has length 23 [2020-11-22 12:56:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:49,040 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 665 transitions. [2020-11-22 12:56:49,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 12:56:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 665 transitions. [2020-11-22 12:56:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-22 12:56:49,041 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:49,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:49,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-22 12:56:49,041 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:49,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:49,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1492688256, now seen corresponding path program 1 times [2020-11-22 12:56:49,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:49,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422659324] [2020-11-22 12:56:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:56:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:56:49,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422659324] [2020-11-22 12:56:49,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:56:49,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 12:56:49,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296194258] [2020-11-22 12:56:49,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 12:56:49,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:56:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 12:56:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:56:49,136 INFO L87 Difference]: Start difference. First operand 306 states and 665 transitions. Second operand 7 states. [2020-11-22 12:56:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:56:49,218 INFO L93 Difference]: Finished difference Result 277 states and 608 transitions. [2020-11-22 12:56:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 12:56:49,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-22 12:56:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:56:49,220 INFO L225 Difference]: With dead ends: 277 [2020-11-22 12:56:49,220 INFO L226 Difference]: Without dead ends: 64 [2020-11-22 12:56:49,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:56:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-22 12:56:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-22 12:56:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-22 12:56:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-11-22 12:56:49,222 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 23 [2020-11-22 12:56:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:56:49,223 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-11-22 12:56:49,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 12:56:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-11-22 12:56:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-22 12:56:49,223 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:56:49,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:56:49,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-22 12:56:49,223 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:56:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:56:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1849601120, now seen corresponding path program 1 times [2020-11-22 12:56:49,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:56:49,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97234002] [2020-11-22 12:56:49,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:56:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:56:49,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:56:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:56:49,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:56:49,340 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-22 12:56:49,340 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-22 12:56:49,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-22 12:56:49,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,368 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-11-22 12:56:49,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:56:49 BasicIcfg [2020-11-22 12:56:49,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-22 12:56:49,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-22 12:56:49,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-22 12:56:49,486 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-22 12:56:49,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:56:34" (3/4) ... [2020-11-22 12:56:49,489 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-22 12:56:49,503 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,503 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-11-22 12:56:49,504 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,504 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,504 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,504 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,505 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,505 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,505 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,506 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,506 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,506 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,509 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,509 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,509 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,510 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,510 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,510 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,510 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,512 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,512 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,512 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:56:49,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:56:49,610 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_361ececa-f34a-4cbc-9d35-f2d4534fe217/bin/utaipan/witness.graphml [2020-11-22 12:56:49,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-22 12:56:49,611 INFO L168 Benchmark]: Toolchain (without parser) took 18317.69 ms. Allocated memory was 144.7 MB in the beginning and 419.4 MB in the end (delta: 274.7 MB). Free memory was 115.8 MB in the beginning and 225.8 MB in the end (delta: -110.0 MB). Peak memory consumption was 164.3 MB. Max. memory is 16.1 GB. [2020-11-22 12:56:49,611 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 86.0 MB. Free memory is still 43.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-22 12:56:49,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.77 ms. Allocated memory is still 144.7 MB. Free memory was 115.4 MB in the beginning and 97.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-22 12:56:49,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.65 ms. Allocated memory is still 144.7 MB. Free memory was 97.1 MB in the beginning and 94.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 12:56:49,614 INFO L168 Benchmark]: Boogie Preprocessor took 84.82 ms. Allocated memory is still 144.7 MB. Free memory was 94.3 MB in the beginning and 92.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 12:56:49,614 INFO L168 Benchmark]: RCFGBuilder took 2447.31 ms. Allocated memory was 144.7 MB in the beginning and 186.6 MB in the end (delta: 41.9 MB). Free memory was 91.8 MB in the beginning and 156.9 MB in the end (delta: -65.0 MB). Peak memory consumption was 58.1 MB. Max. memory is 16.1 GB. [2020-11-22 12:56:49,615 INFO L168 Benchmark]: TraceAbstraction took 14910.20 ms. Allocated memory was 186.6 MB in the beginning and 419.4 MB in the end (delta: 232.8 MB). Free memory was 155.8 MB in the beginning and 245.7 MB in the end (delta: -89.9 MB). Peak memory consumption was 142.9 MB. Max. memory is 16.1 GB. [2020-11-22 12:56:49,615 INFO L168 Benchmark]: Witness Printer took 124.09 ms. Allocated memory is still 419.4 MB. Free memory was 245.7 MB in the beginning and 225.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-22 12:56:49,617 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.24 ms. Allocated memory is still 86.0 MB. Free memory is still 43.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 640.77 ms. Allocated memory is still 144.7 MB. Free memory was 115.4 MB in the beginning and 97.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.65 ms. Allocated memory is still 144.7 MB. Free memory was 97.1 MB in the beginning and 94.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.82 ms. Allocated memory is still 144.7 MB. Free memory was 94.3 MB in the beginning and 92.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2447.31 ms. Allocated memory was 144.7 MB in the beginning and 186.6 MB in the end (delta: 41.9 MB). Free memory was 91.8 MB in the beginning and 156.9 MB in the end (delta: -65.0 MB). Peak memory consumption was 58.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14910.20 ms. Allocated memory was 186.6 MB in the beginning and 419.4 MB in the end (delta: 232.8 MB). Free memory was 155.8 MB in the beginning and 245.7 MB in the end (delta: -89.9 MB). Peak memory consumption was 142.9 MB. Max. memory is 16.1 GB. * Witness Printer took 124.09 ms. Allocated memory is still 419.4 MB. Free memory was 245.7 MB in the beginning and 225.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1738 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 196 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.4s, 126 PlacesBefore, 45 PlacesAfterwards, 116 TransitionsBefore, 33 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 6442 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1525; [L835] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1526; [L837] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1527; [L839] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1528; [L841] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 763 SDtfs, 918 SDslu, 1464 SDs, 0 SdLazy, 555 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 512 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 30721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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...