./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17d5dd9611639a17c428f9a6d0deb2ac118590ac ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-f470102 [2019-12-07 21:04:26,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:04:26,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:04:26,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:04:26,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:04:26,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:04:26,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:04:26,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:04:26,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:04:26,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:04:26,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:04:26,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:04:26,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:04:26,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:04:26,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:04:26,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:04:26,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:04:26,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:04:26,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:04:26,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:04:26,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:04:26,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:04:26,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:04:26,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:04:26,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:04:26,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:04:26,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:04:26,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:04:26,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:04:26,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:04:26,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:04:26,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:04:26,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:04:26,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:04:26,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:04:26,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:04:26,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:04:26,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:04:26,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:04:26,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:04:26,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:04:26,836 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:04:26,846 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:04:26,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:04:26,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:04:26,847 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:04:26,847 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:04:26,847 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:04:26,847 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:04:26,847 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:04:26,847 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:04:26,847 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:04:26,848 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:04:26,848 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:04:26,848 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:04:26,848 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:04:26,848 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:04:26,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:04:26,849 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:04:26,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:04:26,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:04:26,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:04:26,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:04:26,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:04:26,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:04:26,850 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:04:26,850 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:04:26,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:04:26,850 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:04:26,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:04:26,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:04:26,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:04:26,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:04:26,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:04:26,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:04:26,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:04:26,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:04:26,851 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:04:26,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:04:26,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:04:26,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:04:26,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:04:26,852 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17d5dd9611639a17c428f9a6d0deb2ac118590ac [2019-12-07 21:04:26,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:04:26,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:04:26,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:04:26,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:04:26,971 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:04:26,972 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix053_tso.opt.i [2019-12-07 21:04:27,012 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/data/26cc2d134/9dbb2984751f4bfdb9b52ac9e8c76f19/FLAG9fcbaf22c [2019-12-07 21:04:27,505 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:04:27,505 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/sv-benchmarks/c/pthread-wmm/mix053_tso.opt.i [2019-12-07 21:04:27,516 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/data/26cc2d134/9dbb2984751f4bfdb9b52ac9e8c76f19/FLAG9fcbaf22c [2019-12-07 21:04:27,993 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/data/26cc2d134/9dbb2984751f4bfdb9b52ac9e8c76f19 [2019-12-07 21:04:27,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:04:27,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:04:27,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:04:27,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:04:28,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:04:28,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:04:27" (1/1) ... [2019-12-07 21:04:28,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796ae715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28, skipping insertion in model container [2019-12-07 21:04:28,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:04:27" (1/1) ... [2019-12-07 21:04:28,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:04:28,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:04:28,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:04:28,285 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:04:28,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:04:28,376 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:04:28,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28 WrapperNode [2019-12-07 21:04:28,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:04:28,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:04:28,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:04:28,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:04:28,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... [2019-12-07 21:04:28,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... [2019-12-07 21:04:28,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:04:28,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:04:28,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:04:28,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:04:28,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... [2019-12-07 21:04:28,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... [2019-12-07 21:04:28,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... [2019-12-07 21:04:28,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... [2019-12-07 21:04:28,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... [2019-12-07 21:04:28,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... [2019-12-07 21:04:28,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... [2019-12-07 21:04:28,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:04:28,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:04:28,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:04:28,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:04:28,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:04:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:04:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:04:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:04:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:04:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:04:28,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:04:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:04:28,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:04:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:04:28,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:04:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 21:04:28,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 21:04:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:04:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:04:28,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:04:28,485 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 21:04:28,822 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:04:28,823 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:04:28,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:04:28 BoogieIcfgContainer [2019-12-07 21:04:28,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:04:28,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:04:28,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:04:28,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:04:28,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:04:27" (1/3) ... [2019-12-07 21:04:28,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a96ddc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:04:28, skipping insertion in model container [2019-12-07 21:04:28,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:28" (2/3) ... [2019-12-07 21:04:28,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a96ddc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:04:28, skipping insertion in model container [2019-12-07 21:04:28,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:04:28" (3/3) ... [2019-12-07 21:04:28,828 INFO L109 eAbstractionObserver]: Analyzing ICFG mix053_tso.opt.i [2019-12-07 21:04:28,834 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:04:28,834 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:04:28,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:04:28,839 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:04:28,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,865 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,865 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,875 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,876 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,876 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,876 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,876 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:28,891 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 21:04:28,903 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:04:28,903 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:04:28,903 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:04:28,904 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:04:28,904 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:04:28,904 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:04:28,904 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:04:28,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:04:28,915 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 189 transitions [2019-12-07 21:04:28,916 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-07 21:04:28,967 INFO L134 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-07 21:04:28,967 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:04:28,976 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 568 event pairs. 12/160 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 21:04:28,989 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-07 21:04:29,016 INFO L134 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-07 21:04:29,016 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:04:29,021 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 568 event pairs. 12/160 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 21:04:29,032 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 21:04:29,032 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:04:31,810 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-07 21:04:32,132 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 21:04:32,231 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48182 [2019-12-07 21:04:32,231 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-07 21:04:32,233 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 86 transitions [2019-12-07 21:04:33,527 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25454 states. [2019-12-07 21:04:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 25454 states. [2019-12-07 21:04:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:04:33,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:33,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:33,534 INFO L410 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]=== [2019-12-07 21:04:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1973922445, now seen corresponding path program 1 times [2019-12-07 21:04:33,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:33,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788645124] [2019-12-07 21:04:33,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:33,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788645124] [2019-12-07 21:04:33,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:33,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:04:33,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147749419] [2019-12-07 21:04:33,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:33,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:33,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:33,721 INFO L87 Difference]: Start difference. First operand 25454 states. Second operand 3 states. [2019-12-07 21:04:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:34,023 INFO L93 Difference]: Finished difference Result 24966 states and 109408 transitions. [2019-12-07 21:04:34,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:34,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 21:04:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:34,270 INFO L225 Difference]: With dead ends: 24966 [2019-12-07 21:04:34,270 INFO L226 Difference]: Without dead ends: 23406 [2019-12-07 21:04:34,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23406 states. [2019-12-07 21:04:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23406 to 23406. [2019-12-07 21:04:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23406 states. [2019-12-07 21:04:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23406 states to 23406 states and 102424 transitions. [2019-12-07 21:04:35,052 INFO L78 Accepts]: Start accepts. Automaton has 23406 states and 102424 transitions. Word has length 9 [2019-12-07 21:04:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:35,053 INFO L462 AbstractCegarLoop]: Abstraction has 23406 states and 102424 transitions. [2019-12-07 21:04:35,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:04:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 23406 states and 102424 transitions. [2019-12-07 21:04:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:04:35,058 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:35,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:35,059 INFO L410 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]=== [2019-12-07 21:04:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash 918860120, now seen corresponding path program 1 times [2019-12-07 21:04:35,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:35,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194328105] [2019-12-07 21:04:35,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:35,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194328105] [2019-12-07 21:04:35,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:35,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:04:35,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168820288] [2019-12-07 21:04:35,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:04:35,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:35,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:04:35,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:35,118 INFO L87 Difference]: Start difference. First operand 23406 states and 102424 transitions. Second operand 4 states. [2019-12-07 21:04:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:35,430 INFO L93 Difference]: Finished difference Result 36358 states and 153628 transitions. [2019-12-07 21:04:35,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:04:35,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 21:04:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:35,600 INFO L225 Difference]: With dead ends: 36358 [2019-12-07 21:04:35,600 INFO L226 Difference]: Without dead ends: 36298 [2019-12-07 21:04:35,600 INFO L630 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 [2019-12-07 21:04:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36298 states. [2019-12-07 21:04:36,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36298 to 32658. [2019-12-07 21:04:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32658 states. [2019-12-07 21:04:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32658 states to 32658 states and 139904 transitions. [2019-12-07 21:04:36,476 INFO L78 Accepts]: Start accepts. Automaton has 32658 states and 139904 transitions. Word has length 15 [2019-12-07 21:04:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:36,476 INFO L462 AbstractCegarLoop]: Abstraction has 32658 states and 139904 transitions. [2019-12-07 21:04:36,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:04:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32658 states and 139904 transitions. [2019-12-07 21:04:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:04:36,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:36,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:36,481 INFO L410 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]=== [2019-12-07 21:04:36,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1944850996, now seen corresponding path program 1 times [2019-12-07 21:04:36,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:36,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723745893] [2019-12-07 21:04:36,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:36,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723745893] [2019-12-07 21:04:36,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:36,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:04:36,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894103459] [2019-12-07 21:04:36,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:36,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:36,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:36,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:36,519 INFO L87 Difference]: Start difference. First operand 32658 states and 139904 transitions. Second operand 3 states. [2019-12-07 21:04:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:36,698 INFO L93 Difference]: Finished difference Result 43534 states and 182660 transitions. [2019-12-07 21:04:36,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:36,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 21:04:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:36,806 INFO L225 Difference]: With dead ends: 43534 [2019-12-07 21:04:36,806 INFO L226 Difference]: Without dead ends: 43534 [2019-12-07 21:04:36,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43534 states. [2019-12-07 21:04:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43534 to 36962. [2019-12-07 21:04:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36962 states. [2019-12-07 21:04:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36962 states to 36962 states and 157208 transitions. [2019-12-07 21:04:37,723 INFO L78 Accepts]: Start accepts. Automaton has 36962 states and 157208 transitions. Word has length 18 [2019-12-07 21:04:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:37,724 INFO L462 AbstractCegarLoop]: Abstraction has 36962 states and 157208 transitions. [2019-12-07 21:04:37,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:04:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 36962 states and 157208 transitions. [2019-12-07 21:04:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:04:37,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:37,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:37,729 INFO L410 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]=== [2019-12-07 21:04:37,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1944972733, now seen corresponding path program 1 times [2019-12-07 21:04:37,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:37,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296757361] [2019-12-07 21:04:37,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:37,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296757361] [2019-12-07 21:04:37,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:37,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:04:37,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130805954] [2019-12-07 21:04:37,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:04:37,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:04:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:37,772 INFO L87 Difference]: Start difference. First operand 36962 states and 157208 transitions. Second operand 4 states. [2019-12-07 21:04:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:38,015 INFO L93 Difference]: Finished difference Result 44442 states and 186032 transitions. [2019-12-07 21:04:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:04:38,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 21:04:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:38,113 INFO L225 Difference]: With dead ends: 44442 [2019-12-07 21:04:38,113 INFO L226 Difference]: Without dead ends: 44402 [2019-12-07 21:04:38,113 INFO L630 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 [2019-12-07 21:04:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44402 states. [2019-12-07 21:04:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44402 to 38806. [2019-12-07 21:04:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38806 states. [2019-12-07 21:04:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38806 states to 38806 states and 164516 transitions. [2019-12-07 21:04:39,026 INFO L78 Accepts]: Start accepts. Automaton has 38806 states and 164516 transitions. Word has length 18 [2019-12-07 21:04:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:39,026 INFO L462 AbstractCegarLoop]: Abstraction has 38806 states and 164516 transitions. [2019-12-07 21:04:39,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:04:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 38806 states and 164516 transitions. [2019-12-07 21:04:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:04:39,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:39,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:39,031 INFO L410 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]=== [2019-12-07 21:04:39,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:39,031 INFO L82 PathProgramCache]: Analyzing trace with hash -760266034, now seen corresponding path program 1 times [2019-12-07 21:04:39,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:39,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843680257] [2019-12-07 21:04:39,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:39,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843680257] [2019-12-07 21:04:39,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:39,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:04:39,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095477255] [2019-12-07 21:04:39,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:04:39,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:04:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:39,068 INFO L87 Difference]: Start difference. First operand 38806 states and 164516 transitions. Second operand 4 states. [2019-12-07 21:04:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:39,482 INFO L93 Difference]: Finished difference Result 49014 states and 205764 transitions. [2019-12-07 21:04:39,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:04:39,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 21:04:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:39,586 INFO L225 Difference]: With dead ends: 49014 [2019-12-07 21:04:39,586 INFO L226 Difference]: Without dead ends: 48954 [2019-12-07 21:04:39,587 INFO L630 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 [2019-12-07 21:04:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48954 states. [2019-12-07 21:04:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48954 to 40442. [2019-12-07 21:04:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40442 states. [2019-12-07 21:04:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40442 states to 40442 states and 171796 transitions. [2019-12-07 21:04:40,434 INFO L78 Accepts]: Start accepts. Automaton has 40442 states and 171796 transitions. Word has length 18 [2019-12-07 21:04:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:40,434 INFO L462 AbstractCegarLoop]: Abstraction has 40442 states and 171796 transitions. [2019-12-07 21:04:40,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:04:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 40442 states and 171796 transitions. [2019-12-07 21:04:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:04:40,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:40,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:40,442 INFO L410 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]=== [2019-12-07 21:04:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1833759190, now seen corresponding path program 1 times [2019-12-07 21:04:40,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:40,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401269847] [2019-12-07 21:04:40,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:40,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401269847] [2019-12-07 21:04:40,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:40,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:04:40,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119406112] [2019-12-07 21:04:40,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:40,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:40,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:40,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:40,500 INFO L87 Difference]: Start difference. First operand 40442 states and 171796 transitions. Second operand 3 states. [2019-12-07 21:04:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:40,764 INFO L93 Difference]: Finished difference Result 70689 states and 287794 transitions. [2019-12-07 21:04:40,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:40,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 21:04:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:40,911 INFO L225 Difference]: With dead ends: 70689 [2019-12-07 21:04:40,911 INFO L226 Difference]: Without dead ends: 68529 [2019-12-07 21:04:40,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68529 states. [2019-12-07 21:04:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68529 to 65870. [2019-12-07 21:04:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65870 states. [2019-12-07 21:04:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65870 states to 65870 states and 269267 transitions. [2019-12-07 21:04:42,304 INFO L78 Accepts]: Start accepts. Automaton has 65870 states and 269267 transitions. Word has length 20 [2019-12-07 21:04:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:42,304 INFO L462 AbstractCegarLoop]: Abstraction has 65870 states and 269267 transitions. [2019-12-07 21:04:42,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:04:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 65870 states and 269267 transitions. [2019-12-07 21:04:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:04:42,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:42,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:42,321 INFO L410 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]=== [2019-12-07 21:04:42,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash -275146156, now seen corresponding path program 1 times [2019-12-07 21:04:42,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:42,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843687154] [2019-12-07 21:04:42,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:42,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843687154] [2019-12-07 21:04:42,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:42,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:04:42,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25781402] [2019-12-07 21:04:42,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:42,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:42,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:42,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:42,354 INFO L87 Difference]: Start difference. First operand 65870 states and 269267 transitions. Second operand 3 states. [2019-12-07 21:04:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:42,710 INFO L93 Difference]: Finished difference Result 65870 states and 265956 transitions. [2019-12-07 21:04:42,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:42,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 21:04:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:42,848 INFO L225 Difference]: With dead ends: 65870 [2019-12-07 21:04:42,848 INFO L226 Difference]: Without dead ends: 65870 [2019-12-07 21:04:42,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:43,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65870 states. [2019-12-07 21:04:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65870 to 64440. [2019-12-07 21:04:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64440 states. [2019-12-07 21:04:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64440 states to 64440 states and 260872 transitions. [2019-12-07 21:04:44,050 INFO L78 Accepts]: Start accepts. Automaton has 64440 states and 260872 transitions. Word has length 21 [2019-12-07 21:04:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:44,050 INFO L462 AbstractCegarLoop]: Abstraction has 64440 states and 260872 transitions. [2019-12-07 21:04:44,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:04:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 64440 states and 260872 transitions. [2019-12-07 21:04:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:04:44,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:44,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:44,064 INFO L410 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]=== [2019-12-07 21:04:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:44,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1829227400, now seen corresponding path program 1 times [2019-12-07 21:04:44,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:44,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71450133] [2019-12-07 21:04:44,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:44,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71450133] [2019-12-07 21:04:44,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:44,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:04:44,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244452857] [2019-12-07 21:04:44,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:44,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:44,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:44,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:44,095 INFO L87 Difference]: Start difference. First operand 64440 states and 260872 transitions. Second operand 3 states. [2019-12-07 21:04:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:44,337 INFO L93 Difference]: Finished difference Result 63619 states and 256546 transitions. [2019-12-07 21:04:44,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:44,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 21:04:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:44,476 INFO L225 Difference]: With dead ends: 63619 [2019-12-07 21:04:44,477 INFO L226 Difference]: Without dead ends: 62987 [2019-12-07 21:04:44,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62987 states. [2019-12-07 21:04:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62987 to 62987. [2019-12-07 21:04:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62987 states. [2019-12-07 21:04:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62987 states to 62987 states and 254127 transitions. [2019-12-07 21:04:45,781 INFO L78 Accepts]: Start accepts. Automaton has 62987 states and 254127 transitions. Word has length 21 [2019-12-07 21:04:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:45,781 INFO L462 AbstractCegarLoop]: Abstraction has 62987 states and 254127 transitions. [2019-12-07 21:04:45,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:04:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 62987 states and 254127 transitions. [2019-12-07 21:04:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:04:45,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:45,797 INFO L410 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] [2019-12-07 21:04:45,797 INFO L410 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]=== [2019-12-07 21:04:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash -482300191, now seen corresponding path program 1 times [2019-12-07 21:04:45,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:45,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785947175] [2019-12-07 21:04:45,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:45,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785947175] [2019-12-07 21:04:45,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:45,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:04:45,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690807638] [2019-12-07 21:04:45,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:04:45,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:45,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:04:45,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:45,847 INFO L87 Difference]: Start difference. First operand 62987 states and 254127 transitions. Second operand 4 states. [2019-12-07 21:04:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:46,138 INFO L93 Difference]: Finished difference Result 80503 states and 308742 transitions. [2019-12-07 21:04:46,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:04:46,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 21:04:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:46,267 INFO L225 Difference]: With dead ends: 80503 [2019-12-07 21:04:46,267 INFO L226 Difference]: Without dead ends: 63600 [2019-12-07 21:04:46,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63600 states. [2019-12-07 21:04:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63600 to 53716. [2019-12-07 21:04:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53716 states. [2019-12-07 21:04:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53716 states to 53716 states and 198559 transitions. [2019-12-07 21:04:47,539 INFO L78 Accepts]: Start accepts. Automaton has 53716 states and 198559 transitions. Word has length 22 [2019-12-07 21:04:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:47,539 INFO L462 AbstractCegarLoop]: Abstraction has 53716 states and 198559 transitions. [2019-12-07 21:04:47,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:04:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 53716 states and 198559 transitions. [2019-12-07 21:04:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:04:47,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:47,552 INFO L410 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] [2019-12-07 21:04:47,552 INFO L410 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]=== [2019-12-07 21:04:47,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:47,552 INFO L82 PathProgramCache]: Analyzing trace with hash 907111406, now seen corresponding path program 1 times [2019-12-07 21:04:47,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:47,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069042982] [2019-12-07 21:04:47,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:47,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069042982] [2019-12-07 21:04:47,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:47,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:04:47,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048058605] [2019-12-07 21:04:47,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:04:47,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:47,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:04:47,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:47,588 INFO L87 Difference]: Start difference. First operand 53716 states and 198559 transitions. Second operand 4 states. [2019-12-07 21:04:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:47,655 INFO L93 Difference]: Finished difference Result 21609 states and 68201 transitions. [2019-12-07 21:04:47,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:04:47,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 21:04:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:47,680 INFO L225 Difference]: With dead ends: 21609 [2019-12-07 21:04:47,681 INFO L226 Difference]: Without dead ends: 21609 [2019-12-07 21:04:47,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21609 states. [2019-12-07 21:04:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21609 to 21493. [2019-12-07 21:04:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21493 states. [2019-12-07 21:04:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21493 states to 21493 states and 67867 transitions. [2019-12-07 21:04:47,963 INFO L78 Accepts]: Start accepts. Automaton has 21493 states and 67867 transitions. Word has length 22 [2019-12-07 21:04:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:47,963 INFO L462 AbstractCegarLoop]: Abstraction has 21493 states and 67867 transitions. [2019-12-07 21:04:47,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:04:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 21493 states and 67867 transitions. [2019-12-07 21:04:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:04:47,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:47,969 INFO L410 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] [2019-12-07 21:04:47,969 INFO L410 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]=== [2019-12-07 21:04:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2030767179, now seen corresponding path program 1 times [2019-12-07 21:04:47,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:47,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041371097] [2019-12-07 21:04:47,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:47,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041371097] [2019-12-07 21:04:47,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:47,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:04:47,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379079218] [2019-12-07 21:04:47,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:04:47,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:04:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:04:47,998 INFO L87 Difference]: Start difference. First operand 21493 states and 67867 transitions. Second operand 5 states. [2019-12-07 21:04:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:48,035 INFO L93 Difference]: Finished difference Result 5085 states and 13746 transitions. [2019-12-07 21:04:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:04:48,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 21:04:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:48,042 INFO L225 Difference]: With dead ends: 5085 [2019-12-07 21:04:48,042 INFO L226 Difference]: Without dead ends: 5085 [2019-12-07 21:04:48,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:04:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2019-12-07 21:04:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 4486. [2019-12-07 21:04:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4486 states. [2019-12-07 21:04:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4486 states to 4486 states and 12330 transitions. [2019-12-07 21:04:48,093 INFO L78 Accepts]: Start accepts. Automaton has 4486 states and 12330 transitions. Word has length 23 [2019-12-07 21:04:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:48,093 INFO L462 AbstractCegarLoop]: Abstraction has 4486 states and 12330 transitions. [2019-12-07 21:04:48,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:04:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4486 states and 12330 transitions. [2019-12-07 21:04:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 21:04:48,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:48,098 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:48,098 INFO L410 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]=== [2019-12-07 21:04:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 882681234, now seen corresponding path program 1 times [2019-12-07 21:04:48,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:48,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507438018] [2019-12-07 21:04:48,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:48,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507438018] [2019-12-07 21:04:48,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:48,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:04:48,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431984933] [2019-12-07 21:04:48,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:04:48,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:04:48,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:04:48,141 INFO L87 Difference]: Start difference. First operand 4486 states and 12330 transitions. Second operand 5 states. [2019-12-07 21:04:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:48,262 INFO L93 Difference]: Finished difference Result 5732 states and 15248 transitions. [2019-12-07 21:04:48,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:04:48,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 21:04:48,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:48,267 INFO L225 Difference]: With dead ends: 5732 [2019-12-07 21:04:48,267 INFO L226 Difference]: Without dead ends: 5666 [2019-12-07 21:04:48,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:04:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5666 states. [2019-12-07 21:04:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5666 to 4746. [2019-12-07 21:04:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4746 states. [2019-12-07 21:04:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4746 states to 4746 states and 12993 transitions. [2019-12-07 21:04:48,320 INFO L78 Accepts]: Start accepts. Automaton has 4746 states and 12993 transitions. Word has length 32 [2019-12-07 21:04:48,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:48,320 INFO L462 AbstractCegarLoop]: Abstraction has 4746 states and 12993 transitions. [2019-12-07 21:04:48,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:04:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4746 states and 12993 transitions. [2019-12-07 21:04:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 21:04:48,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:48,325 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:48,325 INFO L410 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]=== [2019-12-07 21:04:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1233303667, now seen corresponding path program 1 times [2019-12-07 21:04:48,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:48,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434878537] [2019-12-07 21:04:48,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:48,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434878537] [2019-12-07 21:04:48,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:48,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:04:48,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53554352] [2019-12-07 21:04:48,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:48,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:48,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:48,346 INFO L87 Difference]: Start difference. First operand 4746 states and 12993 transitions. Second operand 3 states. [2019-12-07 21:04:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:48,375 INFO L93 Difference]: Finished difference Result 5164 states and 13270 transitions. [2019-12-07 21:04:48,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:48,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 21:04:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:48,379 INFO L225 Difference]: With dead ends: 5164 [2019-12-07 21:04:48,379 INFO L226 Difference]: Without dead ends: 5164 [2019-12-07 21:04:48,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2019-12-07 21:04:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 4658. [2019-12-07 21:04:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4658 states. [2019-12-07 21:04:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 12085 transitions. [2019-12-07 21:04:48,424 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 12085 transitions. Word has length 32 [2019-12-07 21:04:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:48,424 INFO L462 AbstractCegarLoop]: Abstraction has 4658 states and 12085 transitions. [2019-12-07 21:04:48,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:04:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 12085 transitions. [2019-12-07 21:04:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:04:48,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:48,428 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:48,429 INFO L410 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]=== [2019-12-07 21:04:48,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1540331556, now seen corresponding path program 1 times [2019-12-07 21:04:48,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:48,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429157296] [2019-12-07 21:04:48,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:48,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429157296] [2019-12-07 21:04:48,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:48,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:04:48,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867533560] [2019-12-07 21:04:48,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:04:48,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:04:48,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:04:48,467 INFO L87 Difference]: Start difference. First operand 4658 states and 12085 transitions. Second operand 5 states. [2019-12-07 21:04:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:48,598 INFO L93 Difference]: Finished difference Result 5265 states and 13401 transitions. [2019-12-07 21:04:48,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:04:48,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 21:04:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:48,603 INFO L225 Difference]: With dead ends: 5265 [2019-12-07 21:04:48,603 INFO L226 Difference]: Without dead ends: 5182 [2019-12-07 21:04:48,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:04:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2019-12-07 21:04:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 4401. [2019-12-07 21:04:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4401 states. [2019-12-07 21:04:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4401 states to 4401 states and 11433 transitions. [2019-12-07 21:04:48,649 INFO L78 Accepts]: Start accepts. Automaton has 4401 states and 11433 transitions. Word has length 33 [2019-12-07 21:04:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:48,649 INFO L462 AbstractCegarLoop]: Abstraction has 4401 states and 11433 transitions. [2019-12-07 21:04:48,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:04:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4401 states and 11433 transitions. [2019-12-07 21:04:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:04:48,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:48,653 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:48,654 INFO L410 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]=== [2019-12-07 21:04:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash -513213168, now seen corresponding path program 1 times [2019-12-07 21:04:48,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:48,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124159396] [2019-12-07 21:04:48,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:48,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124159396] [2019-12-07 21:04:48,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:48,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:04:48,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232589959] [2019-12-07 21:04:48,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:04:48,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:48,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:04:48,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:48,713 INFO L87 Difference]: Start difference. First operand 4401 states and 11433 transitions. Second operand 4 states. [2019-12-07 21:04:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:48,749 INFO L93 Difference]: Finished difference Result 7091 states and 17940 transitions. [2019-12-07 21:04:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:04:48,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 21:04:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:48,752 INFO L225 Difference]: With dead ends: 7091 [2019-12-07 21:04:48,752 INFO L226 Difference]: Without dead ends: 2289 [2019-12-07 21:04:48,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-12-07 21:04:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 2252. [2019-12-07 21:04:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2252 states. [2019-12-07 21:04:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 5014 transitions. [2019-12-07 21:04:48,780 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 5014 transitions. Word has length 33 [2019-12-07 21:04:48,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:48,780 INFO L462 AbstractCegarLoop]: Abstraction has 2252 states and 5014 transitions. [2019-12-07 21:04:48,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:04:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 5014 transitions. [2019-12-07 21:04:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:04:48,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:48,783 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:48,783 INFO L410 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]=== [2019-12-07 21:04:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:48,783 INFO L82 PathProgramCache]: Analyzing trace with hash -741863528, now seen corresponding path program 1 times [2019-12-07 21:04:48,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:48,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439427106] [2019-12-07 21:04:48,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:48,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439427106] [2019-12-07 21:04:48,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:48,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:04:48,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621424372] [2019-12-07 21:04:48,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:04:48,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:48,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:04:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:48,843 INFO L87 Difference]: Start difference. First operand 2252 states and 5014 transitions. Second operand 4 states. [2019-12-07 21:04:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:48,882 INFO L93 Difference]: Finished difference Result 3357 states and 7549 transitions. [2019-12-07 21:04:48,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:04:48,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 21:04:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:48,886 INFO L225 Difference]: With dead ends: 3357 [2019-12-07 21:04:48,886 INFO L226 Difference]: Without dead ends: 2995 [2019-12-07 21:04:48,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:04:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-12-07 21:04:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2955. [2019-12-07 21:04:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2955 states. [2019-12-07 21:04:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 6548 transitions. [2019-12-07 21:04:48,917 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 6548 transitions. Word has length 34 [2019-12-07 21:04:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:48,918 INFO L462 AbstractCegarLoop]: Abstraction has 2955 states and 6548 transitions. [2019-12-07 21:04:48,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:04:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 6548 transitions. [2019-12-07 21:04:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:04:48,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:48,919 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:48,919 INFO L410 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]=== [2019-12-07 21:04:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1411804038, now seen corresponding path program 2 times [2019-12-07 21:04:48,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:48,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192655501] [2019-12-07 21:04:48,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:48,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192655501] [2019-12-07 21:04:48,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:48,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:04:48,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185205143] [2019-12-07 21:04:48,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:04:48,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:48,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:04:48,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:04:48,969 INFO L87 Difference]: Start difference. First operand 2955 states and 6548 transitions. Second operand 5 states. [2019-12-07 21:04:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:49,013 INFO L93 Difference]: Finished difference Result 4075 states and 9098 transitions. [2019-12-07 21:04:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:04:49,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 21:04:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:49,015 INFO L225 Difference]: With dead ends: 4075 [2019-12-07 21:04:49,015 INFO L226 Difference]: Without dead ends: 2104 [2019-12-07 21:04:49,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:04:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2019-12-07 21:04:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2066. [2019-12-07 21:04:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2066 states. [2019-12-07 21:04:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 4531 transitions. [2019-12-07 21:04:49,041 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 4531 transitions. Word has length 34 [2019-12-07 21:04:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:49,041 INFO L462 AbstractCegarLoop]: Abstraction has 2066 states and 4531 transitions. [2019-12-07 21:04:49,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:04:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 4531 transitions. [2019-12-07 21:04:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:04:49,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:49,043 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:49,043 INFO L410 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]=== [2019-12-07 21:04:49,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:49,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1558435352, now seen corresponding path program 3 times [2019-12-07 21:04:49,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:49,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596311932] [2019-12-07 21:04:49,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:49,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596311932] [2019-12-07 21:04:49,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:49,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:04:49,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594910379] [2019-12-07 21:04:49,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:04:49,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:49,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:04:49,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:04:49,089 INFO L87 Difference]: Start difference. First operand 2066 states and 4531 transitions. Second operand 6 states. [2019-12-07 21:04:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:49,113 INFO L93 Difference]: Finished difference Result 1297 states and 2748 transitions. [2019-12-07 21:04:49,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:04:49,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 21:04:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:49,114 INFO L225 Difference]: With dead ends: 1297 [2019-12-07 21:04:49,114 INFO L226 Difference]: Without dead ends: 490 [2019-12-07 21:04:49,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:04:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-07 21:04:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-12-07 21:04:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-07 21:04:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1054 transitions. [2019-12-07 21:04:49,119 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1054 transitions. Word has length 34 [2019-12-07 21:04:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:49,119 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1054 transitions. [2019-12-07 21:04:49,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:04:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1054 transitions. [2019-12-07 21:04:49,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 21:04:49,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:49,120 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:49,120 INFO L410 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]=== [2019-12-07 21:04:49,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash -880706143, now seen corresponding path program 1 times [2019-12-07 21:04:49,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:49,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727324207] [2019-12-07 21:04:49,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:49,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727324207] [2019-12-07 21:04:49,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:49,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:04:49,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298215512] [2019-12-07 21:04:49,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:04:49,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:04:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:04:49,187 INFO L87 Difference]: Start difference. First operand 490 states and 1054 transitions. Second operand 7 states. [2019-12-07 21:04:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:49,350 INFO L93 Difference]: Finished difference Result 890 states and 1868 transitions. [2019-12-07 21:04:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:04:49,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 21:04:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:49,351 INFO L225 Difference]: With dead ends: 890 [2019-12-07 21:04:49,351 INFO L226 Difference]: Without dead ends: 604 [2019-12-07 21:04:49,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:04:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-07 21:04:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 546. [2019-12-07 21:04:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-07 21:04:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1139 transitions. [2019-12-07 21:04:49,356 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1139 transitions. Word has length 48 [2019-12-07 21:04:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:49,356 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1139 transitions. [2019-12-07 21:04:49,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:04:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1139 transitions. [2019-12-07 21:04:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 21:04:49,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:49,356 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:49,356 INFO L410 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]=== [2019-12-07 21:04:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash 81842901, now seen corresponding path program 2 times [2019-12-07 21:04:49,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:49,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905425448] [2019-12-07 21:04:49,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:04:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:04:49,428 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:04:49,428 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:04:49,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_91| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_232) (= v_~weak$$choice2~0_162 0) (= v_~x~0_82 0) (= v_~z$w_buff1~0_269 0) (= v_~z$mem_tmp~0_40 0) (= 0 v_~z$flush_delayed~0_66) (= (select .cse0 |v_ULTIMATE.start_main_~#t1437~0.base_44|) 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1437~0.base_44| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1437~0.base_44|) |v_ULTIMATE.start_main_~#t1437~0.offset_29| 0)) |v_#memory_int_25|) (= v_~z$w_buff0_used~0_718 0) (= v_~z$r_buff0_thd2~0_22 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff0_thd4~0_134) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1437~0.base_44|) (= v_~z$r_buff0_thd0~0_100 0) (= v_~z$w_buff0~0_458 0) (= 0 v_~z$r_buff1_thd4~0_125) (= |v_#valid_89| (store .cse0 |v_ULTIMATE.start_main_~#t1437~0.base_44| 1)) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p3_EAX~0_102 0) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~weak$$choice0~0_37) (< 0 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1437~0.offset_29| 0) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1437~0.base_44| 4)) (= v_~main$tmp_guard1~0_47 0) (= v_~y~0_80 0) (= v_~z$r_buff0_thd1~0_23 0) (= v_~a~0_45 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff1_used~0_462 0) (= v_~z$r_buff1_thd0~0_156 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd1~0_67) (= 0 v_~z$r_buff0_thd3~0_296) (= v_~z~0_165 0) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$r_buff1_thd2~0_67))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ULTIMATE.start_main_~#t1440~0.offset=|v_ULTIMATE.start_main_~#t1440~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_67, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1438~0.offset=|v_ULTIMATE.start_main_~#t1438~0.offset_29|, ~a~0=v_~a~0_45, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_100, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_102, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_40, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_80|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ULTIMATE.start_main_~#t1437~0.base=|v_ULTIMATE.start_main_~#t1437~0.base_44|, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_67, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_296, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t1437~0.offset=|v_ULTIMATE.start_main_~#t1437~0.offset_29|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_125, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ULTIMATE.start_main_~#t1438~0.base=|v_ULTIMATE.start_main_~#t1438~0.base_44|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_269, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_156, ~y~0=v_~y~0_80, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_22, ULTIMATE.start_main_~#t1439~0.offset=|v_ULTIMATE.start_main_~#t1439~0.offset_20|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_718, ~z$w_buff0~0=v_~z$w_buff0~0_458, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_232, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1440~0.base=|v_ULTIMATE.start_main_~#t1440~0.base_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_106|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_165, ULTIMATE.start_main_~#t1439~0.base=|v_ULTIMATE.start_main_~#t1439~0.base_36|, ~weak$$choice2~0=v_~weak$$choice2~0_162, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1440~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1438~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1437~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1437~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1438~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1439~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1440~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1439~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:04:49,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1438~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t1438~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1438~0.base_12| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1438~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t1438~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1438~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1438~0.base_12|) |v_ULTIMATE.start_main_~#t1438~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1438~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1438~0.offset=|v_ULTIMATE.start_main_~#t1438~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1438~0.base=|v_ULTIMATE.start_main_~#t1438~0.base_12|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1438~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1438~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:04:49,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1439~0.offset_10| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1439~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1439~0.base_11| 4)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1439~0.base_11| 1) |v_#valid_37|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1439~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1439~0.base_11|) |v_ULTIMATE.start_main_~#t1439~0.offset_10| 2)) |v_#memory_int_15|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1439~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1439~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1439~0.offset=|v_ULTIMATE.start_main_~#t1439~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1439~0.base=|v_ULTIMATE.start_main_~#t1439~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1439~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1439~0.base] because there is no mapped edge [2019-12-07 21:04:49,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L835-1-->L837: Formula: (and (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1440~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1440~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1440~0.base_12| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1440~0.base_12| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1440~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1440~0.base_12|) |v_ULTIMATE.start_main_~#t1440~0.offset_10| 3)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1440~0.base_12|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1440~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1440~0.base=|v_ULTIMATE.start_main_~#t1440~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1440~0.offset=|v_ULTIMATE.start_main_~#t1440~0.offset_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1440~0.base, ULTIMATE.start_main_~#t1440~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:04:49,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_70) (= 1 v_~z$w_buff0~0_43) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15) (= v_P3Thread1of1ForFork1_~arg.offset_13 |v_P3Thread1of1ForFork1_#in~arg.offset_15|) (= v_P3Thread1of1ForFork1_~arg.base_13 |v_P3Thread1of1ForFork1_#in~arg.base_15|) (= v_~z$w_buff0_used~0_99 1) (= v_~z$w_buff0~0_44 v_~z$w_buff1~0_34) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_99 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_70 256))))) 1 0))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_44, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_43, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_13, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 21:04:49,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_24| v_P0Thread1of1ForFork2_~arg.offset_22) (= v_P0Thread1of1ForFork2_~arg.base_22 |v_P0Thread1of1ForFork2_#in~arg.base_24|) (= v_~a~0_34 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_120 (+ v_~__unbuffered_cnt~0_121 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|} OutVars{~a~0=v_~a~0_34, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_22, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_42, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 21:04:49,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~x~0_38 2) (= v_~__unbuffered_cnt~0_114 (+ v_~__unbuffered_cnt~0_115 1)) (= v_~y~0_33 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_15| v_P1Thread1of1ForFork3_~arg.offset_13) (= |v_P1Thread1of1ForFork3_#in~arg.base_15| v_P1Thread1of1ForFork3_~arg.base_13)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_13, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_13, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|, ~y~0=v_~y~0_33, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 21:04:49,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1048859124 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1048859124 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1048859124 |P3Thread1of1ForFork1_#t~ite28_Out1048859124|)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out1048859124| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1048859124, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1048859124} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1048859124, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1048859124|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1048859124} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 21:04:49,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In1808448422 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1808448422 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1808448422 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1808448422 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out1808448422|)) (and (= ~z$w_buff1_used~0_In1808448422 |P3Thread1of1ForFork1_#t~ite29_Out1808448422|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1808448422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1808448422, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1808448422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1808448422} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1808448422, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1808448422|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1808448422, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1808448422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1808448422} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 21:04:49,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L811-->L812: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out1524144889 ~z$r_buff0_thd4~0_In1524144889)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1524144889 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1524144889 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~z$r_buff0_thd4~0_Out1524144889 0) (not .cse2) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1524144889, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1524144889} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1524144889, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1524144889, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out1524144889|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 21:04:49,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In561315904 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In561315904 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In561315904 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In561315904 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite31_Out561315904|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In561315904 |P3Thread1of1ForFork1_#t~ite31_Out561315904|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In561315904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In561315904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In561315904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In561315904} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In561315904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In561315904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In561315904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In561315904, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out561315904|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 21:04:49,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-317970821 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out-317970821| ~z$w_buff1~0_In-317970821) (= |P2Thread1of1ForFork0_#t~ite11_Out-317970821| |P2Thread1of1ForFork0_#t~ite12_Out-317970821|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-317970821 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-317970821 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-317970821 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-317970821 256) 0)))) (and (= |P2Thread1of1ForFork0_#t~ite11_In-317970821| |P2Thread1of1ForFork0_#t~ite11_Out-317970821|) (= |P2Thread1of1ForFork0_#t~ite12_Out-317970821| ~z$w_buff1~0_In-317970821) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-317970821, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-317970821|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-317970821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-317970821, ~z$w_buff1~0=~z$w_buff1~0_In-317970821, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-317970821, ~weak$$choice2~0=~weak$$choice2~0_In-317970821} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-317970821|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-317970821, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-317970821|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-317970821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-317970821, ~z$w_buff1~0=~z$w_buff1~0_In-317970821, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-317970821, ~weak$$choice2~0=~weak$$choice2~0_In-317970821} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 21:04:49,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_98 (+ v_~__unbuffered_cnt~0_99 1)) (= v_~z$r_buff1_thd4~0_48 |v_P3Thread1of1ForFork1_#t~ite31_44|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_44|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_43|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 21:04:49,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L776-->L777: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_5|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_11|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 21:04:49,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L779-->L787: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~z~0_33 v_~z$mem_tmp~0_8)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 21:04:49,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L837-1-->L843: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:04:49,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L843-2-->L843-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1940796110 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-1940796110| |ULTIMATE.start_main_#t~ite36_Out-1940796110|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1940796110 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-1940796110 |ULTIMATE.start_main_#t~ite36_Out-1940796110|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1940796110| ~z$w_buff1~0_In-1940796110) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1940796110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940796110, ~z$w_buff1~0=~z$w_buff1~0_In-1940796110, ~z~0=~z~0_In-1940796110} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1940796110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940796110, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1940796110|, ~z$w_buff1~0=~z$w_buff1~0_In-1940796110, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1940796110|, ~z~0=~z~0_In-1940796110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 21:04:49,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1979357698 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1979357698 256) 0))) (or (and (= ~z$w_buff0_used~0_In1979357698 |ULTIMATE.start_main_#t~ite38_Out1979357698|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1979357698|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1979357698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1979357698} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1979357698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1979357698, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1979357698|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 21:04:49,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In193574006 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In193574006 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In193574006 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In193574006 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out193574006| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out193574006| ~z$w_buff1_used~0_In193574006) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In193574006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In193574006, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In193574006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In193574006} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In193574006, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out193574006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In193574006, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In193574006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In193574006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 21:04:49,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1423588387 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1423588387 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1423588387 |ULTIMATE.start_main_#t~ite40_Out-1423588387|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1423588387| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1423588387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1423588387} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1423588387, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1423588387|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1423588387} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 21:04:49,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In936426036 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In936426036 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In936426036 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In936426036 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out936426036| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out936426036| ~z$r_buff1_thd0~0_In936426036) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In936426036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In936426036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In936426036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In936426036} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out936426036|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In936426036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In936426036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In936426036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In936426036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 21:04:49,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EAX~0_70) (= v_~y~0_43 2) (= 0 v_~__unbuffered_p2_EAX~0_28) (= v_~x~0_52 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_115 |v_ULTIMATE.start_main_#t~ite41_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_46|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_115, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:04:49,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:04:49 BasicIcfg [2019-12-07 21:04:49,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:04:49,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:04:49,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:04:49,504 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:04:49,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:04:28" (3/4) ... [2019-12-07 21:04:49,506 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:04:49,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_91| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_232) (= v_~weak$$choice2~0_162 0) (= v_~x~0_82 0) (= v_~z$w_buff1~0_269 0) (= v_~z$mem_tmp~0_40 0) (= 0 v_~z$flush_delayed~0_66) (= (select .cse0 |v_ULTIMATE.start_main_~#t1437~0.base_44|) 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1437~0.base_44| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1437~0.base_44|) |v_ULTIMATE.start_main_~#t1437~0.offset_29| 0)) |v_#memory_int_25|) (= v_~z$w_buff0_used~0_718 0) (= v_~z$r_buff0_thd2~0_22 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff0_thd4~0_134) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1437~0.base_44|) (= v_~z$r_buff0_thd0~0_100 0) (= v_~z$w_buff0~0_458 0) (= 0 v_~z$r_buff1_thd4~0_125) (= |v_#valid_89| (store .cse0 |v_ULTIMATE.start_main_~#t1437~0.base_44| 1)) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p3_EAX~0_102 0) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~weak$$choice0~0_37) (< 0 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1437~0.offset_29| 0) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1437~0.base_44| 4)) (= v_~main$tmp_guard1~0_47 0) (= v_~y~0_80 0) (= v_~z$r_buff0_thd1~0_23 0) (= v_~a~0_45 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff1_used~0_462 0) (= v_~z$r_buff1_thd0~0_156 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd1~0_67) (= 0 v_~z$r_buff0_thd3~0_296) (= v_~z~0_165 0) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$r_buff1_thd2~0_67))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ULTIMATE.start_main_~#t1440~0.offset=|v_ULTIMATE.start_main_~#t1440~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_67, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1438~0.offset=|v_ULTIMATE.start_main_~#t1438~0.offset_29|, ~a~0=v_~a~0_45, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_100, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_102, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_40, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_80|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ULTIMATE.start_main_~#t1437~0.base=|v_ULTIMATE.start_main_~#t1437~0.base_44|, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_67, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_296, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t1437~0.offset=|v_ULTIMATE.start_main_~#t1437~0.offset_29|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_125, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ULTIMATE.start_main_~#t1438~0.base=|v_ULTIMATE.start_main_~#t1438~0.base_44|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_269, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_156, ~y~0=v_~y~0_80, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_22, ULTIMATE.start_main_~#t1439~0.offset=|v_ULTIMATE.start_main_~#t1439~0.offset_20|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_718, ~z$w_buff0~0=v_~z$w_buff0~0_458, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_232, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1440~0.base=|v_ULTIMATE.start_main_~#t1440~0.base_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_106|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_165, ULTIMATE.start_main_~#t1439~0.base=|v_ULTIMATE.start_main_~#t1439~0.base_36|, ~weak$$choice2~0=v_~weak$$choice2~0_162, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1440~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1438~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1437~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1437~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1438~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1439~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1440~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1439~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:04:49,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1438~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t1438~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1438~0.base_12| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1438~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t1438~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1438~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1438~0.base_12|) |v_ULTIMATE.start_main_~#t1438~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1438~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1438~0.offset=|v_ULTIMATE.start_main_~#t1438~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1438~0.base=|v_ULTIMATE.start_main_~#t1438~0.base_12|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1438~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1438~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:04:49,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1439~0.offset_10| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1439~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1439~0.base_11| 4)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1439~0.base_11| 1) |v_#valid_37|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1439~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1439~0.base_11|) |v_ULTIMATE.start_main_~#t1439~0.offset_10| 2)) |v_#memory_int_15|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1439~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1439~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1439~0.offset=|v_ULTIMATE.start_main_~#t1439~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1439~0.base=|v_ULTIMATE.start_main_~#t1439~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1439~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1439~0.base] because there is no mapped edge [2019-12-07 21:04:49,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L835-1-->L837: Formula: (and (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1440~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1440~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1440~0.base_12| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1440~0.base_12| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1440~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1440~0.base_12|) |v_ULTIMATE.start_main_~#t1440~0.offset_10| 3)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1440~0.base_12|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1440~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1440~0.base=|v_ULTIMATE.start_main_~#t1440~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1440~0.offset=|v_ULTIMATE.start_main_~#t1440~0.offset_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1440~0.base, ULTIMATE.start_main_~#t1440~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:04:49,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_70) (= 1 v_~z$w_buff0~0_43) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15) (= v_P3Thread1of1ForFork1_~arg.offset_13 |v_P3Thread1of1ForFork1_#in~arg.offset_15|) (= v_P3Thread1of1ForFork1_~arg.base_13 |v_P3Thread1of1ForFork1_#in~arg.base_15|) (= v_~z$w_buff0_used~0_99 1) (= v_~z$w_buff0~0_44 v_~z$w_buff1~0_34) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_99 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_70 256))))) 1 0))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_44, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_43, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_13, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 21:04:49,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_24| v_P0Thread1of1ForFork2_~arg.offset_22) (= v_P0Thread1of1ForFork2_~arg.base_22 |v_P0Thread1of1ForFork2_#in~arg.base_24|) (= v_~a~0_34 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_120 (+ v_~__unbuffered_cnt~0_121 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|} OutVars{~a~0=v_~a~0_34, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_22, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_42, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 21:04:49,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~x~0_38 2) (= v_~__unbuffered_cnt~0_114 (+ v_~__unbuffered_cnt~0_115 1)) (= v_~y~0_33 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_15| v_P1Thread1of1ForFork3_~arg.offset_13) (= |v_P1Thread1of1ForFork3_#in~arg.base_15| v_P1Thread1of1ForFork3_~arg.base_13)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_13, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_13, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|, ~y~0=v_~y~0_33, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 21:04:49,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1048859124 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1048859124 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1048859124 |P3Thread1of1ForFork1_#t~ite28_Out1048859124|)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out1048859124| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1048859124, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1048859124} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1048859124, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1048859124|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1048859124} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 21:04:49,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In1808448422 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1808448422 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1808448422 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1808448422 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out1808448422|)) (and (= ~z$w_buff1_used~0_In1808448422 |P3Thread1of1ForFork1_#t~ite29_Out1808448422|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1808448422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1808448422, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1808448422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1808448422} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1808448422, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1808448422|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1808448422, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1808448422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1808448422} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 21:04:49,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L811-->L812: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out1524144889 ~z$r_buff0_thd4~0_In1524144889)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1524144889 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1524144889 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~z$r_buff0_thd4~0_Out1524144889 0) (not .cse2) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1524144889, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1524144889} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1524144889, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1524144889, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out1524144889|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 21:04:49,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In561315904 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In561315904 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In561315904 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In561315904 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite31_Out561315904|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In561315904 |P3Thread1of1ForFork1_#t~ite31_Out561315904|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In561315904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In561315904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In561315904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In561315904} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In561315904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In561315904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In561315904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In561315904, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out561315904|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 21:04:49,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-317970821 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out-317970821| ~z$w_buff1~0_In-317970821) (= |P2Thread1of1ForFork0_#t~ite11_Out-317970821| |P2Thread1of1ForFork0_#t~ite12_Out-317970821|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-317970821 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-317970821 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-317970821 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-317970821 256) 0)))) (and (= |P2Thread1of1ForFork0_#t~ite11_In-317970821| |P2Thread1of1ForFork0_#t~ite11_Out-317970821|) (= |P2Thread1of1ForFork0_#t~ite12_Out-317970821| ~z$w_buff1~0_In-317970821) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-317970821, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-317970821|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-317970821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-317970821, ~z$w_buff1~0=~z$w_buff1~0_In-317970821, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-317970821, ~weak$$choice2~0=~weak$$choice2~0_In-317970821} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-317970821|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-317970821, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-317970821|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-317970821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-317970821, ~z$w_buff1~0=~z$w_buff1~0_In-317970821, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-317970821, ~weak$$choice2~0=~weak$$choice2~0_In-317970821} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 21:04:49,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_98 (+ v_~__unbuffered_cnt~0_99 1)) (= v_~z$r_buff1_thd4~0_48 |v_P3Thread1of1ForFork1_#t~ite31_44|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_44|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_43|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 21:04:49,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L776-->L777: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_5|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_11|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 21:04:49,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L779-->L787: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~z~0_33 v_~z$mem_tmp~0_8)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 21:04:49,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L837-1-->L843: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:04:49,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L843-2-->L843-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1940796110 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-1940796110| |ULTIMATE.start_main_#t~ite36_Out-1940796110|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1940796110 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-1940796110 |ULTIMATE.start_main_#t~ite36_Out-1940796110|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1940796110| ~z$w_buff1~0_In-1940796110) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1940796110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940796110, ~z$w_buff1~0=~z$w_buff1~0_In-1940796110, ~z~0=~z~0_In-1940796110} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1940796110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940796110, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1940796110|, ~z$w_buff1~0=~z$w_buff1~0_In-1940796110, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1940796110|, ~z~0=~z~0_In-1940796110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 21:04:49,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1979357698 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1979357698 256) 0))) (or (and (= ~z$w_buff0_used~0_In1979357698 |ULTIMATE.start_main_#t~ite38_Out1979357698|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1979357698|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1979357698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1979357698} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1979357698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1979357698, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1979357698|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 21:04:49,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In193574006 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In193574006 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In193574006 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In193574006 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out193574006| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out193574006| ~z$w_buff1_used~0_In193574006) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In193574006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In193574006, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In193574006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In193574006} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In193574006, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out193574006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In193574006, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In193574006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In193574006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 21:04:49,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1423588387 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1423588387 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1423588387 |ULTIMATE.start_main_#t~ite40_Out-1423588387|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1423588387| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1423588387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1423588387} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1423588387, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1423588387|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1423588387} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 21:04:49,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In936426036 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In936426036 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In936426036 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In936426036 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out936426036| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out936426036| ~z$r_buff1_thd0~0_In936426036) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In936426036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In936426036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In936426036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In936426036} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out936426036|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In936426036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In936426036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In936426036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In936426036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 21:04:49,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EAX~0_70) (= v_~y~0_43 2) (= 0 v_~__unbuffered_p2_EAX~0_28) (= v_~x~0_52 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_115 |v_ULTIMATE.start_main_#t~ite41_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_46|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_115, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:04:49,582 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bdab87be-1d9a-459f-8eb0-73b1f22b5511/bin/utaipan/witness.graphml [2019-12-07 21:04:49,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:04:49,584 INFO L168 Benchmark]: Toolchain (without parser) took 21587.78 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 940.7 MB in the beginning and 1.4 GB in the end (delta: -457.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 21:04:49,584 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:04:49,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:04:49,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:04:49,585 INFO L168 Benchmark]: Boogie Preprocessor took 25.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:04:49,586 INFO L168 Benchmark]: RCFGBuilder took 381.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:04:49,586 INFO L168 Benchmark]: TraceAbstraction took 20679.50 ms. Allocated memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -410.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 21:04:49,586 INFO L168 Benchmark]: Witness Printer took 78.94 ms. Allocated memory is still 3.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:04:49,588 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 381.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20679.50 ms. Allocated memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -410.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 78.94 ms. Allocated memory is still 3.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 167 ProgramPointsBefore, 78 ProgramPointsAfterwards, 189 TransitionsBefore, 86 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 19 ChoiceCompositions, 5650 VarBasedMoverChecksPositive, 211 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 185 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 48182 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L833] FCALL, FORK 0 pthread_create(&t1438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L835] FCALL, FORK 0 pthread_create(&t1439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L837] FCALL, FORK 0 pthread_create(&t1440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L797] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L798] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L799] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L800] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L801] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L802] 4 z$r_buff0_thd4 = (_Bool)1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 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) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 3 z$flush_delayed = weak$$choice2 [L770] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 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) [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L810] 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 [L771] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L772] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L774] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 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) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 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) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2268 SDtfs, 2174 SDslu, 3292 SDs, 0 SdLazy, 976 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65870occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 41388 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 468 ConstructedInterpolants, 0 QuantifiedInterpolants, 80288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...