./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_rmo.oepc.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_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96136e3dc3d91e584f17fee70f1afce511b6ac15 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:24:48,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:24:48,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:24:48,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:24:48,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:24:48,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:24:48,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:24:48,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:24:48,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:24:48,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:24:48,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:24:48,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:24:48,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:24:48,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:24:48,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:24:48,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:24:48,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:24:48,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:24:48,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:24:48,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:24:48,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:24:48,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:24:48,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:24:48,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:24:48,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:24:48,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:24:48,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:24:48,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:24:48,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:24:48,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:24:48,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:24:48,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:24:48,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:24:48,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:24:48,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:24:48,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:24:48,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:24:48,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:24:48,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:24:48,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:24:48,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:24:48,861 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:24:48,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:24:48,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:24:48,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:24:48,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:24:48,875 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:24:48,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:24:48,875 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:24:48,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:24:48,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:24:48,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:24:48,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:24:48,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:24:48,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:24:48,876 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:24:48,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:24:48,877 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:24:48,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:24:48,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:24:48,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:24:48,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:24:48,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:24:48,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:24:48,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:24:48,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:24:48,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:24:48,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:24:48,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:24:48,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:24:48,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:24:48,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer 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 -> Automizer 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 -> 96136e3dc3d91e584f17fee70f1afce511b6ac15 [2019-12-07 13:24:48,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:24:48,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:24:48,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:24:48,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:24:48,997 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:24:48,997 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe031_rmo.oepc.i [2019-12-07 13:24:49,034 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/data/3fdb8baa9/cc275fa8ed8943d9a3cdb60ac89ed218/FLAGa473b2b00 [2019-12-07 13:24:49,502 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:24:49,502 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/sv-benchmarks/c/pthread-wmm/safe031_rmo.oepc.i [2019-12-07 13:24:49,513 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/data/3fdb8baa9/cc275fa8ed8943d9a3cdb60ac89ed218/FLAGa473b2b00 [2019-12-07 13:24:49,522 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/data/3fdb8baa9/cc275fa8ed8943d9a3cdb60ac89ed218 [2019-12-07 13:24:49,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:24:49,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:24:49,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:24:49,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:24:49,528 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:24:49,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49, skipping insertion in model container [2019-12-07 13:24:49,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:24:49,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:24:49,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:24:49,809 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:24:49,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:24:49,895 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:24:49,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49 WrapperNode [2019-12-07 13:24:49,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:24:49,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:24:49,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:24:49,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:24:49,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:24:49,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:24:49,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:24:49,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:24:49,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... [2019-12-07 13:24:49,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:24:49,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:24:49,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:24:49,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:24:49,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/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 13:24:50,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:24:50,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:24:50,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:24:50,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:24:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:24:50,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:24:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:24:50,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:24:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:24:50,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:24:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:24:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:24:50,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:24:50,009 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:24:50,366 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:24:50,366 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:24:50,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:24:50 BoogieIcfgContainer [2019-12-07 13:24:50,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:24:50,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:24:50,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:24:50,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:24:50,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:24:49" (1/3) ... [2019-12-07 13:24:50,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb7d3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:24:50, skipping insertion in model container [2019-12-07 13:24:50,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:49" (2/3) ... [2019-12-07 13:24:50,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb7d3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:24:50, skipping insertion in model container [2019-12-07 13:24:50,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:24:50" (3/3) ... [2019-12-07 13:24:50,372 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_rmo.oepc.i [2019-12-07 13:24:50,379 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:24:50,379 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:24:50,384 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:24:50,385 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:24:50,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,435 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,435 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:24:50,453 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:24:50,468 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:24:50,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:24:50,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:24:50,468 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:24:50,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:24:50,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:24:50,469 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:24:50,469 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:24:50,483 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-07 13:24:50,485 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-07 13:24:50,543 INFO L134 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-07 13:24:50,543 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:24:50,555 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 713 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 13:24:50,572 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-07 13:24:50,607 INFO L134 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-07 13:24:50,607 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:24:50,613 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 713 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 13:24:50,629 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 13:24:50,630 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:24:53,586 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 13:24:53,766 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 13:24:53,867 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64880 [2019-12-07 13:24:53,867 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 13:24:53,870 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 13:25:02,948 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83222 states. [2019-12-07 13:25:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 83222 states. [2019-12-07 13:25:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:25:02,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:02,953 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:25:02,954 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:02,957 INFO L82 PathProgramCache]: Analyzing trace with hash 793650723, now seen corresponding path program 1 times [2019-12-07 13:25:02,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:02,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374883944] [2019-12-07 13:25:02,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:03,106 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 13:25:03,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374883944] [2019-12-07 13:25:03,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:03,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:25:03,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200996507] [2019-12-07 13:25:03,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:03,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:03,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:03,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:03,122 INFO L87 Difference]: Start difference. First operand 83222 states. Second operand 3 states. [2019-12-07 13:25:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:03,770 INFO L93 Difference]: Finished difference Result 82272 states and 355122 transitions. [2019-12-07 13:25:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:03,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:25:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:04,203 INFO L225 Difference]: With dead ends: 82272 [2019-12-07 13:25:04,203 INFO L226 Difference]: Without dead ends: 77232 [2019-12-07 13:25:04,204 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 13:25:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77232 states. [2019-12-07 13:25:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77232 to 77232. [2019-12-07 13:25:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77232 states. [2019-12-07 13:25:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77232 states to 77232 states and 332862 transitions. [2019-12-07 13:25:08,202 INFO L78 Accepts]: Start accepts. Automaton has 77232 states and 332862 transitions. Word has length 5 [2019-12-07 13:25:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:08,202 INFO L462 AbstractCegarLoop]: Abstraction has 77232 states and 332862 transitions. [2019-12-07 13:25:08,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 77232 states and 332862 transitions. [2019-12-07 13:25:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:25:08,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:08,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:08,210 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash -187432799, now seen corresponding path program 1 times [2019-12-07 13:25:08,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:08,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179040243] [2019-12-07 13:25:08,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:08,272 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 13:25:08,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179040243] [2019-12-07 13:25:08,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:08,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:25:08,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738411901] [2019-12-07 13:25:08,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:25:08,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:25:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:25:08,274 INFO L87 Difference]: Start difference. First operand 77232 states and 332862 transitions. Second operand 4 states. [2019-12-07 13:25:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:08,998 INFO L93 Difference]: Finished difference Result 119112 states and 491884 transitions. [2019-12-07 13:25:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:25:08,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:25:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:09,341 INFO L225 Difference]: With dead ends: 119112 [2019-12-07 13:25:09,341 INFO L226 Difference]: Without dead ends: 119007 [2019-12-07 13:25:09,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 13:25:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119007 states. [2019-12-07 13:25:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119007 to 111499. [2019-12-07 13:25:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111499 states. [2019-12-07 13:25:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111499 states to 111499 states and 464543 transitions. [2019-12-07 13:25:16,089 INFO L78 Accepts]: Start accepts. Automaton has 111499 states and 464543 transitions. Word has length 13 [2019-12-07 13:25:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:16,090 INFO L462 AbstractCegarLoop]: Abstraction has 111499 states and 464543 transitions. [2019-12-07 13:25:16,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:25:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 111499 states and 464543 transitions. [2019-12-07 13:25:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:25:16,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:16,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:16,093 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:16,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:16,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1509262706, now seen corresponding path program 1 times [2019-12-07 13:25:16,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:16,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275569478] [2019-12-07 13:25:16,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:16,138 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 13:25:16,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275569478] [2019-12-07 13:25:16,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:16,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:25:16,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172124981] [2019-12-07 13:25:16,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:25:16,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:16,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:25:16,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:25:16,139 INFO L87 Difference]: Start difference. First operand 111499 states and 464543 transitions. Second operand 4 states. [2019-12-07 13:25:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:17,152 INFO L93 Difference]: Finished difference Result 158605 states and 645510 transitions. [2019-12-07 13:25:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:25:17,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:25:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:17,554 INFO L225 Difference]: With dead ends: 158605 [2019-12-07 13:25:17,554 INFO L226 Difference]: Without dead ends: 158485 [2019-12-07 13:25:17,554 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 13:25:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158485 states. [2019-12-07 13:25:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158485 to 134738. [2019-12-07 13:25:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134738 states. [2019-12-07 13:25:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134738 states to 134738 states and 557345 transitions. [2019-12-07 13:25:25,525 INFO L78 Accepts]: Start accepts. Automaton has 134738 states and 557345 transitions. Word has length 13 [2019-12-07 13:25:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:25,525 INFO L462 AbstractCegarLoop]: Abstraction has 134738 states and 557345 transitions. [2019-12-07 13:25:25,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:25:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 134738 states and 557345 transitions. [2019-12-07 13:25:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:25:25,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:25,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:25,529 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2053226586, now seen corresponding path program 1 times [2019-12-07 13:25:25,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:25,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701378996] [2019-12-07 13:25:25,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:25,573 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 13:25:25,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701378996] [2019-12-07 13:25:25,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:25,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:25:25,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483446013] [2019-12-07 13:25:25,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:25:25,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:25,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:25:25,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:25:25,575 INFO L87 Difference]: Start difference. First operand 134738 states and 557345 transitions. Second operand 5 states. [2019-12-07 13:25:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:26,525 INFO L93 Difference]: Finished difference Result 183165 states and 744415 transitions. [2019-12-07 13:25:26,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:25:26,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 13:25:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:26,972 INFO L225 Difference]: With dead ends: 183165 [2019-12-07 13:25:26,972 INFO L226 Difference]: Without dead ends: 183013 [2019-12-07 13:25:26,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:25:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183013 states. [2019-12-07 13:25:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183013 to 148564. [2019-12-07 13:25:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148564 states. [2019-12-07 13:25:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148564 states to 148564 states and 613463 transitions. [2019-12-07 13:25:33,812 INFO L78 Accepts]: Start accepts. Automaton has 148564 states and 613463 transitions. Word has length 14 [2019-12-07 13:25:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:33,812 INFO L462 AbstractCegarLoop]: Abstraction has 148564 states and 613463 transitions. [2019-12-07 13:25:33,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:25:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 148564 states and 613463 transitions. [2019-12-07 13:25:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:25:33,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:33,828 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 13:25:33,828 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2099469612, now seen corresponding path program 1 times [2019-12-07 13:25:33,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:33,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034411996] [2019-12-07 13:25:33,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:33,879 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 13:25:33,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034411996] [2019-12-07 13:25:33,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:33,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:25:33,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809831017] [2019-12-07 13:25:33,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:33,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:33,881 INFO L87 Difference]: Start difference. First operand 148564 states and 613463 transitions. Second operand 3 states. [2019-12-07 13:25:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:34,508 INFO L93 Difference]: Finished difference Result 148564 states and 607673 transitions. [2019-12-07 13:25:34,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:34,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:25:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:34,874 INFO L225 Difference]: With dead ends: 148564 [2019-12-07 13:25:34,874 INFO L226 Difference]: Without dead ends: 148564 [2019-12-07 13:25:34,875 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 13:25:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148564 states. [2019-12-07 13:25:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148564 to 146584. [2019-12-07 13:25:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146584 states. [2019-12-07 13:25:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146584 states to 146584 states and 600131 transitions. [2019-12-07 13:25:43,400 INFO L78 Accepts]: Start accepts. Automaton has 146584 states and 600131 transitions. Word has length 18 [2019-12-07 13:25:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:43,400 INFO L462 AbstractCegarLoop]: Abstraction has 146584 states and 600131 transitions. [2019-12-07 13:25:43,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 146584 states and 600131 transitions. [2019-12-07 13:25:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:25:43,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:43,411 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 13:25:43,411 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2089612406, now seen corresponding path program 1 times [2019-12-07 13:25:43,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:43,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165634731] [2019-12-07 13:25:43,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:43,457 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 13:25:43,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165634731] [2019-12-07 13:25:43,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:43,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:25:43,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130268104] [2019-12-07 13:25:43,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:43,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:43,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:43,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:43,458 INFO L87 Difference]: Start difference. First operand 146584 states and 600131 transitions. Second operand 3 states. [2019-12-07 13:25:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:44,638 INFO L93 Difference]: Finished difference Result 272448 states and 1107573 transitions. [2019-12-07 13:25:44,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:44,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:25:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:45,294 INFO L225 Difference]: With dead ends: 272448 [2019-12-07 13:25:45,294 INFO L226 Difference]: Without dead ends: 261792 [2019-12-07 13:25:45,294 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 13:25:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261792 states. [2019-12-07 13:25:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261792 to 250613. [2019-12-07 13:25:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250613 states. [2019-12-07 13:25:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250613 states to 250613 states and 1027376 transitions. [2019-12-07 13:25:55,217 INFO L78 Accepts]: Start accepts. Automaton has 250613 states and 1027376 transitions. Word has length 18 [2019-12-07 13:25:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:55,217 INFO L462 AbstractCegarLoop]: Abstraction has 250613 states and 1027376 transitions. [2019-12-07 13:25:55,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 250613 states and 1027376 transitions. [2019-12-07 13:25:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:25:55,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:55,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:55,239 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:55,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:55,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1438263838, now seen corresponding path program 1 times [2019-12-07 13:25:55,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:55,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526637467] [2019-12-07 13:25:55,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:55,269 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 13:25:55,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526637467] [2019-12-07 13:25:55,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:55,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:25:55,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155733347] [2019-12-07 13:25:55,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:55,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:55,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:55,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:55,271 INFO L87 Difference]: Start difference. First operand 250613 states and 1027376 transitions. Second operand 3 states. [2019-12-07 13:25:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:55,417 INFO L93 Difference]: Finished difference Result 48671 states and 160112 transitions. [2019-12-07 13:25:55,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:55,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 13:25:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:55,491 INFO L225 Difference]: With dead ends: 48671 [2019-12-07 13:25:55,491 INFO L226 Difference]: Without dead ends: 48671 [2019-12-07 13:25:55,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:25:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48671 states. [2019-12-07 13:25:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48671 to 48671. [2019-12-07 13:25:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48671 states. [2019-12-07 13:25:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48671 states to 48671 states and 160112 transitions. [2019-12-07 13:25:56,253 INFO L78 Accepts]: Start accepts. Automaton has 48671 states and 160112 transitions. Word has length 19 [2019-12-07 13:25:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:56,253 INFO L462 AbstractCegarLoop]: Abstraction has 48671 states and 160112 transitions. [2019-12-07 13:25:56,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 48671 states and 160112 transitions. [2019-12-07 13:25:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:25:56,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:56,262 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 13:25:56,262 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:56,263 INFO L82 PathProgramCache]: Analyzing trace with hash 112714396, now seen corresponding path program 1 times [2019-12-07 13:25:56,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:56,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675008059] [2019-12-07 13:25:56,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:56,319 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 13:25:56,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675008059] [2019-12-07 13:25:56,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:56,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:25:56,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764045702] [2019-12-07 13:25:56,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:56,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:56,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:56,320 INFO L87 Difference]: Start difference. First operand 48671 states and 160112 transitions. Second operand 6 states. [2019-12-07 13:25:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:56,876 INFO L93 Difference]: Finished difference Result 68053 states and 219263 transitions. [2019-12-07 13:25:56,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:25:56,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 13:25:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:56,980 INFO L225 Difference]: With dead ends: 68053 [2019-12-07 13:25:56,980 INFO L226 Difference]: Without dead ends: 67939 [2019-12-07 13:25:56,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:25:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67939 states. [2019-12-07 13:25:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67939 to 51075. [2019-12-07 13:25:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51075 states. [2019-12-07 13:25:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51075 states to 51075 states and 167119 transitions. [2019-12-07 13:25:59,160 INFO L78 Accepts]: Start accepts. Automaton has 51075 states and 167119 transitions. Word has length 22 [2019-12-07 13:25:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:59,160 INFO L462 AbstractCegarLoop]: Abstraction has 51075 states and 167119 transitions. [2019-12-07 13:25:59,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 51075 states and 167119 transitions. [2019-12-07 13:25:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:25:59,169 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:59,170 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 13:25:59,170 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:59,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:59,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1117346120, now seen corresponding path program 1 times [2019-12-07 13:25:59,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:59,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261715680] [2019-12-07 13:25:59,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:59,210 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 13:25:59,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261715680] [2019-12-07 13:25:59,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:59,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:25:59,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008459483] [2019-12-07 13:25:59,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:59,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:59,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:59,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:59,212 INFO L87 Difference]: Start difference. First operand 51075 states and 167119 transitions. Second operand 6 states. [2019-12-07 13:25:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:59,798 INFO L93 Difference]: Finished difference Result 75038 states and 239298 transitions. [2019-12-07 13:25:59,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:25:59,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 13:25:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:59,916 INFO L225 Difference]: With dead ends: 75038 [2019-12-07 13:25:59,916 INFO L226 Difference]: Without dead ends: 74924 [2019-12-07 13:25:59,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:26:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74924 states. [2019-12-07 13:26:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74924 to 55248. [2019-12-07 13:26:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55248 states. [2019-12-07 13:26:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55248 states to 55248 states and 178792 transitions. [2019-12-07 13:26:00,977 INFO L78 Accepts]: Start accepts. Automaton has 55248 states and 178792 transitions. Word has length 22 [2019-12-07 13:26:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:00,978 INFO L462 AbstractCegarLoop]: Abstraction has 55248 states and 178792 transitions. [2019-12-07 13:26:00,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 55248 states and 178792 transitions. [2019-12-07 13:26:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:26:00,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:00,997 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] [2019-12-07 13:26:00,997 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:00,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:00,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1691433742, now seen corresponding path program 1 times [2019-12-07 13:26:00,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:00,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482374831] [2019-12-07 13:26:00,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:01,041 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 13:26:01,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482374831] [2019-12-07 13:26:01,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:01,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:26:01,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816536817] [2019-12-07 13:26:01,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:26:01,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:26:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:26:01,042 INFO L87 Difference]: Start difference. First operand 55248 states and 178792 transitions. Second operand 5 states. [2019-12-07 13:26:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:01,450 INFO L93 Difference]: Finished difference Result 74024 states and 236084 transitions. [2019-12-07 13:26:01,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:26:01,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 13:26:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:01,561 INFO L225 Difference]: With dead ends: 74024 [2019-12-07 13:26:01,561 INFO L226 Difference]: Without dead ends: 73999 [2019-12-07 13:26:01,561 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 13:26:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73999 states. [2019-12-07 13:26:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73999 to 65282. [2019-12-07 13:26:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65282 states. [2019-12-07 13:26:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65282 states to 65282 states and 209652 transitions. [2019-12-07 13:26:02,784 INFO L78 Accepts]: Start accepts. Automaton has 65282 states and 209652 transitions. Word has length 25 [2019-12-07 13:26:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:02,784 INFO L462 AbstractCegarLoop]: Abstraction has 65282 states and 209652 transitions. [2019-12-07 13:26:02,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:26:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 65282 states and 209652 transitions. [2019-12-07 13:26:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:26:02,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:02,809 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] [2019-12-07 13:26:02,809 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:02,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1769481889, now seen corresponding path program 1 times [2019-12-07 13:26:02,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:02,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736188364] [2019-12-07 13:26:02,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:02,849 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 13:26:02,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736188364] [2019-12-07 13:26:02,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:02,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:26:02,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969146520] [2019-12-07 13:26:02,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:02,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:02,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:02,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:02,851 INFO L87 Difference]: Start difference. First operand 65282 states and 209652 transitions. Second operand 6 states. [2019-12-07 13:26:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:03,422 INFO L93 Difference]: Finished difference Result 85200 states and 270589 transitions. [2019-12-07 13:26:03,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:26:03,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 13:26:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:03,548 INFO L225 Difference]: With dead ends: 85200 [2019-12-07 13:26:03,548 INFO L226 Difference]: Without dead ends: 85028 [2019-12-07 13:26:03,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:26:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85028 states. [2019-12-07 13:26:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85028 to 67549. [2019-12-07 13:26:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67549 states. [2019-12-07 13:26:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67549 states to 67549 states and 216505 transitions. [2019-12-07 13:26:04,754 INFO L78 Accepts]: Start accepts. Automaton has 67549 states and 216505 transitions. Word has length 28 [2019-12-07 13:26:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:04,754 INFO L462 AbstractCegarLoop]: Abstraction has 67549 states and 216505 transitions. [2019-12-07 13:26:04,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 67549 states and 216505 transitions. [2019-12-07 13:26:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:26:04,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:04,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] [2019-12-07 13:26:04,783 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1394476543, now seen corresponding path program 1 times [2019-12-07 13:26:04,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:04,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531541244] [2019-12-07 13:26:04,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:04,813 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 13:26:04,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531541244] [2019-12-07 13:26:04,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:04,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:26:04,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843736311] [2019-12-07 13:26:04,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:26:04,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:26:04,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:26:04,814 INFO L87 Difference]: Start difference. First operand 67549 states and 216505 transitions. Second operand 3 states. [2019-12-07 13:26:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:05,095 INFO L93 Difference]: Finished difference Result 99550 states and 323277 transitions. [2019-12-07 13:26:05,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:26:05,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 13:26:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:05,166 INFO L225 Difference]: With dead ends: 99550 [2019-12-07 13:26:05,167 INFO L226 Difference]: Without dead ends: 44602 [2019-12-07 13:26:05,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:26:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44602 states. [2019-12-07 13:26:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44602 to 42785. [2019-12-07 13:26:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42785 states. [2019-12-07 13:26:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42785 states to 42785 states and 137282 transitions. [2019-12-07 13:26:05,959 INFO L78 Accepts]: Start accepts. Automaton has 42785 states and 137282 transitions. Word has length 30 [2019-12-07 13:26:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:05,959 INFO L462 AbstractCegarLoop]: Abstraction has 42785 states and 137282 transitions. [2019-12-07 13:26:05,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:26:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 42785 states and 137282 transitions. [2019-12-07 13:26:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 13:26:05,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:05,978 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] [2019-12-07 13:26:05,978 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:05,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1297629797, now seen corresponding path program 1 times [2019-12-07 13:26:05,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:05,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109237366] [2019-12-07 13:26:05,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:06,009 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 13:26:06,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109237366] [2019-12-07 13:26:06,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:06,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:26:06,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188567601] [2019-12-07 13:26:06,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:26:06,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:06,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:26:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:26:06,010 INFO L87 Difference]: Start difference. First operand 42785 states and 137282 transitions. Second operand 4 states. [2019-12-07 13:26:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:06,062 INFO L93 Difference]: Finished difference Result 16283 states and 49133 transitions. [2019-12-07 13:26:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:26:06,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 13:26:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:06,080 INFO L225 Difference]: With dead ends: 16283 [2019-12-07 13:26:06,080 INFO L226 Difference]: Without dead ends: 16259 [2019-12-07 13:26:06,081 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 13:26:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16259 states. [2019-12-07 13:26:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16259 to 14559. [2019-12-07 13:26:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14559 states. [2019-12-07 13:26:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14559 states to 14559 states and 44878 transitions. [2019-12-07 13:26:06,291 INFO L78 Accepts]: Start accepts. Automaton has 14559 states and 44878 transitions. Word has length 31 [2019-12-07 13:26:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:06,291 INFO L462 AbstractCegarLoop]: Abstraction has 14559 states and 44878 transitions. [2019-12-07 13:26:06,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:26:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 14559 states and 44878 transitions. [2019-12-07 13:26:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:26:06,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:06,305 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] [2019-12-07 13:26:06,305 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1169825091, now seen corresponding path program 1 times [2019-12-07 13:26:06,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:06,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957755444] [2019-12-07 13:26:06,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:06,447 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 13:26:06,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957755444] [2019-12-07 13:26:06,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:06,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:26:06,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004420631] [2019-12-07 13:26:06,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:26:06,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:06,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:26:06,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:26:06,448 INFO L87 Difference]: Start difference. First operand 14559 states and 44878 transitions. Second operand 10 states. [2019-12-07 13:26:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:07,118 INFO L93 Difference]: Finished difference Result 18466 states and 54858 transitions. [2019-12-07 13:26:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:26:07,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-07 13:26:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:07,137 INFO L225 Difference]: With dead ends: 18466 [2019-12-07 13:26:07,137 INFO L226 Difference]: Without dead ends: 18374 [2019-12-07 13:26:07,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:26:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18374 states. [2019-12-07 13:26:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18374 to 14521. [2019-12-07 13:26:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14521 states. [2019-12-07 13:26:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14521 states to 14521 states and 44794 transitions. [2019-12-07 13:26:07,361 INFO L78 Accepts]: Start accepts. Automaton has 14521 states and 44794 transitions. Word has length 40 [2019-12-07 13:26:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:07,361 INFO L462 AbstractCegarLoop]: Abstraction has 14521 states and 44794 transitions. [2019-12-07 13:26:07,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:26:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 14521 states and 44794 transitions. [2019-12-07 13:26:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:26:07,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:07,374 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] [2019-12-07 13:26:07,375 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:07,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash -907253271, now seen corresponding path program 2 times [2019-12-07 13:26:07,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:07,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481688833] [2019-12-07 13:26:07,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:07,428 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 13:26:07,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481688833] [2019-12-07 13:26:07,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:07,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:26:07,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404093380] [2019-12-07 13:26:07,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:26:07,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:07,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:26:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:26:07,430 INFO L87 Difference]: Start difference. First operand 14521 states and 44794 transitions. Second operand 7 states. [2019-12-07 13:26:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:07,876 INFO L93 Difference]: Finished difference Result 18293 states and 54354 transitions. [2019-12-07 13:26:07,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 13:26:07,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 13:26:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:07,894 INFO L225 Difference]: With dead ends: 18293 [2019-12-07 13:26:07,894 INFO L226 Difference]: Without dead ends: 18199 [2019-12-07 13:26:07,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:26:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18199 states. [2019-12-07 13:26:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18199 to 13568. [2019-12-07 13:26:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13568 states. [2019-12-07 13:26:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13568 states to 13568 states and 42145 transitions. [2019-12-07 13:26:08,108 INFO L78 Accepts]: Start accepts. Automaton has 13568 states and 42145 transitions. Word has length 40 [2019-12-07 13:26:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:08,109 INFO L462 AbstractCegarLoop]: Abstraction has 13568 states and 42145 transitions. [2019-12-07 13:26:08,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:26:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 13568 states and 42145 transitions. [2019-12-07 13:26:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 13:26:08,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:08,121 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] [2019-12-07 13:26:08,121 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash -393588074, now seen corresponding path program 1 times [2019-12-07 13:26:08,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:08,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214450589] [2019-12-07 13:26:08,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:08,168 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 13:26:08,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214450589] [2019-12-07 13:26:08,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:08,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:26:08,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831910677] [2019-12-07 13:26:08,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:26:08,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:08,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:26:08,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:26:08,170 INFO L87 Difference]: Start difference. First operand 13568 states and 42145 transitions. Second operand 3 states. [2019-12-07 13:26:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:08,209 INFO L93 Difference]: Finished difference Result 12798 states and 38984 transitions. [2019-12-07 13:26:08,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:26:08,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 13:26:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:08,224 INFO L225 Difference]: With dead ends: 12798 [2019-12-07 13:26:08,224 INFO L226 Difference]: Without dead ends: 12798 [2019-12-07 13:26:08,225 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 13:26:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12798 states. [2019-12-07 13:26:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12798 to 12694. [2019-12-07 13:26:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12694 states. [2019-12-07 13:26:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12694 states to 12694 states and 38722 transitions. [2019-12-07 13:26:08,391 INFO L78 Accepts]: Start accepts. Automaton has 12694 states and 38722 transitions. Word has length 41 [2019-12-07 13:26:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:08,391 INFO L462 AbstractCegarLoop]: Abstraction has 12694 states and 38722 transitions. [2019-12-07 13:26:08,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:26:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 12694 states and 38722 transitions. [2019-12-07 13:26:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 13:26:08,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:08,401 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] [2019-12-07 13:26:08,401 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1503767133, now seen corresponding path program 1 times [2019-12-07 13:26:08,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:08,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126716943] [2019-12-07 13:26:08,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:08,444 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 13:26:08,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126716943] [2019-12-07 13:26:08,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:08,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:26:08,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675051658] [2019-12-07 13:26:08,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:26:08,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:26:08,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:26:08,445 INFO L87 Difference]: Start difference. First operand 12694 states and 38722 transitions. Second operand 5 states. [2019-12-07 13:26:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:08,490 INFO L93 Difference]: Finished difference Result 11317 states and 35418 transitions. [2019-12-07 13:26:08,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:26:08,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 13:26:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:08,506 INFO L225 Difference]: With dead ends: 11317 [2019-12-07 13:26:08,506 INFO L226 Difference]: Without dead ends: 10193 [2019-12-07 13:26:08,506 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 13:26:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10193 states. [2019-12-07 13:26:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10193 to 6888. [2019-12-07 13:26:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6888 states. [2019-12-07 13:26:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6888 states to 6888 states and 21750 transitions. [2019-12-07 13:26:08,640 INFO L78 Accepts]: Start accepts. Automaton has 6888 states and 21750 transitions. Word has length 42 [2019-12-07 13:26:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:08,640 INFO L462 AbstractCegarLoop]: Abstraction has 6888 states and 21750 transitions. [2019-12-07 13:26:08,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:26:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 6888 states and 21750 transitions. [2019-12-07 13:26:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:26:08,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:08,646 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:26:08,646 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1636664138, now seen corresponding path program 1 times [2019-12-07 13:26:08,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:08,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083890041] [2019-12-07 13:26:08,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:08,673 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 13:26:08,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083890041] [2019-12-07 13:26:08,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:08,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:26:08,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360226433] [2019-12-07 13:26:08,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:26:08,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:26:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:26:08,675 INFO L87 Difference]: Start difference. First operand 6888 states and 21750 transitions. Second operand 3 states. [2019-12-07 13:26:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:08,717 INFO L93 Difference]: Finished difference Result 9413 states and 29007 transitions. [2019-12-07 13:26:08,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:26:08,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 13:26:08,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:08,726 INFO L225 Difference]: With dead ends: 9413 [2019-12-07 13:26:08,726 INFO L226 Difference]: Without dead ends: 9413 [2019-12-07 13:26:08,726 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 13:26:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9413 states. [2019-12-07 13:26:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9413 to 7614. [2019-12-07 13:26:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2019-12-07 13:26:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 23938 transitions. [2019-12-07 13:26:08,842 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 23938 transitions. Word has length 56 [2019-12-07 13:26:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:08,843 INFO L462 AbstractCegarLoop]: Abstraction has 7614 states and 23938 transitions. [2019-12-07 13:26:08,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:26:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 23938 transitions. [2019-12-07 13:26:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:26:08,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:08,849 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:26:08,849 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:08,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1645756632, now seen corresponding path program 1 times [2019-12-07 13:26:08,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:08,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292576993] [2019-12-07 13:26:08,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:08,893 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 13:26:08,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292576993] [2019-12-07 13:26:08,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:08,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:26:08,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756491143] [2019-12-07 13:26:08,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:08,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:08,894 INFO L87 Difference]: Start difference. First operand 7614 states and 23938 transitions. Second operand 6 states. [2019-12-07 13:26:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:09,093 INFO L93 Difference]: Finished difference Result 22892 states and 71010 transitions. [2019-12-07 13:26:09,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:26:09,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 13:26:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:09,119 INFO L225 Difference]: With dead ends: 22892 [2019-12-07 13:26:09,119 INFO L226 Difference]: Without dead ends: 17372 [2019-12-07 13:26:09,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:26:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17372 states. [2019-12-07 13:26:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17372 to 10223. [2019-12-07 13:26:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10223 states. [2019-12-07 13:26:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10223 states to 10223 states and 32197 transitions. [2019-12-07 13:26:09,338 INFO L78 Accepts]: Start accepts. Automaton has 10223 states and 32197 transitions. Word has length 56 [2019-12-07 13:26:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:09,338 INFO L462 AbstractCegarLoop]: Abstraction has 10223 states and 32197 transitions. [2019-12-07 13:26:09,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 10223 states and 32197 transitions. [2019-12-07 13:26:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:26:09,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:09,348 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:26:09,348 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:09,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2046427888, now seen corresponding path program 2 times [2019-12-07 13:26:09,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:09,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377298560] [2019-12-07 13:26:09,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:09,399 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 13:26:09,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377298560] [2019-12-07 13:26:09,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:09,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:26:09,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190763612] [2019-12-07 13:26:09,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:26:09,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:26:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:26:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:26:09,400 INFO L87 Difference]: Start difference. First operand 10223 states and 32197 transitions. Second operand 4 states. [2019-12-07 13:26:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:09,453 INFO L93 Difference]: Finished difference Result 17877 states and 56342 transitions. [2019-12-07 13:26:09,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:26:09,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 13:26:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:09,460 INFO L225 Difference]: With dead ends: 17877 [2019-12-07 13:26:09,461 INFO L226 Difference]: Without dead ends: 6022 [2019-12-07 13:26:09,461 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 13:26:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2019-12-07 13:26:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 6022. [2019-12-07 13:26:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2019-12-07 13:26:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 18810 transitions. [2019-12-07 13:26:09,548 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 18810 transitions. Word has length 56 [2019-12-07 13:26:09,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:09,548 INFO L462 AbstractCegarLoop]: Abstraction has 6022 states and 18810 transitions. [2019-12-07 13:26:09,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:26:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 18810 transitions. [2019-12-07 13:26:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:26:09,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:09,553 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:26:09,553 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:09,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1377038518, now seen corresponding path program 3 times [2019-12-07 13:26:09,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:26:09,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300392788] [2019-12-07 13:26:09,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:26:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:26:09,620 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:26:09,620 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:26:09,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= v_~main$tmp_guard0~0_19 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30| 1)) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30|) |v_ULTIMATE.start_main_~#t2525~0.offset_17| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd1~0_390 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30|) 0) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2525~0.base_30| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t2525~0.offset_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2525~0.base_30|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_~#t2525~0.base=|v_ULTIMATE.start_main_~#t2525~0.base_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_24|, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_24|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ~weak$$choice0~0=v_~weak$$choice0~0_29, ULTIMATE.start_main_~#t2525~0.offset=|v_ULTIMATE.start_main_~#t2525~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2526~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2525~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2527~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2526~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2527~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2525~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 13:26:09,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2526~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t2526~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13|) |v_ULTIMATE.start_main_~#t2526~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2526~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2526~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2526~0.offset, ULTIMATE.start_main_~#t2526~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 13:26:09,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (= 1 v_~y~0_6) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:26:09,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2527~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13|) |v_ULTIMATE.start_main_~#t2527~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2527~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13| 1) |v_#valid_32|) (= 0 |v_ULTIMATE.start_main_~#t2527~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2527~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2527~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2527~0.offset] because there is no mapped edge [2019-12-07 13:26:09,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1363827512 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1363827512 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1363827512| ~x~0_In-1363827512)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1363827512| ~x$w_buff1~0_In-1363827512) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1363827512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1363827512, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1363827512, ~x~0=~x~0_In-1363827512} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1363827512|, ~x$w_buff1~0=~x$w_buff1~0_In-1363827512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1363827512, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1363827512, ~x~0=~x~0_In-1363827512} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 13:26:09,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 13:26:09,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1323070378 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1323070378 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1323070378| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1323070378 |P2Thread1of1ForFork1_#t~ite34_Out-1323070378|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1323070378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1323070378} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1323070378|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1323070378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1323070378} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:26:09,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In707603331 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In707603331 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In707603331 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In707603331 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out707603331|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In707603331 |P2Thread1of1ForFork1_#t~ite35_Out707603331|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In707603331, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In707603331, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In707603331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707603331} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out707603331|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In707603331, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In707603331, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In707603331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707603331} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:26:09,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2103668030 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-2103668030 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-2103668030| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-2103668030| ~x$r_buff0_thd3~0_In-2103668030)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2103668030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103668030} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2103668030|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2103668030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103668030} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:26:09,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1129319347 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1129319347 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1129319347 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1129319347 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In-1129319347 |P2Thread1of1ForFork1_#t~ite37_Out-1129319347|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1129319347|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1129319347, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1129319347, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1129319347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129319347} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1129319347|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1129319347, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1129319347, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1129319347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129319347} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:26:09,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_34|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:26:09,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1444683561 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out-1444683561| |P0Thread1of1ForFork2_#t~ite11_Out-1444683561|) .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out-1444683561| ~x$w_buff1~0_In-1444683561) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1444683561 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1444683561 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1444683561 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-1444683561 256) 0) .cse1)))) (and (= |P0Thread1of1ForFork2_#t~ite11_In-1444683561| |P0Thread1of1ForFork2_#t~ite11_Out-1444683561|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out-1444683561| ~x$w_buff1~0_In-1444683561)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1444683561, ~x$w_buff1~0=~x$w_buff1~0_In-1444683561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1444683561, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1444683561, ~weak$$choice2~0=~weak$$choice2~0_In-1444683561, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1444683561|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1444683561} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1444683561, ~x$w_buff1~0=~x$w_buff1~0_In-1444683561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1444683561, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1444683561, ~weak$$choice2~0=~weak$$choice2~0_In-1444683561, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1444683561|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1444683561|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1444683561} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:26:09,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-73836390 256)))) (or (and (= ~x$w_buff0_used~0_In-73836390 |P0Thread1of1ForFork2_#t~ite14_Out-73836390|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-73836390 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In-73836390 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In-73836390 256) 0) (and (= (mod ~x$w_buff1_used~0_In-73836390 256) 0) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite15_Out-73836390| |P0Thread1of1ForFork2_#t~ite14_Out-73836390|)) (and (= ~x$w_buff0_used~0_In-73836390 |P0Thread1of1ForFork2_#t~ite15_Out-73836390|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In-73836390| |P0Thread1of1ForFork2_#t~ite14_Out-73836390|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-73836390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73836390, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-73836390, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-73836390|, ~weak$$choice2~0=~weak$$choice2~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-73836390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73836390, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-73836390|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-73836390, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-73836390|, ~weak$$choice2~0=~weak$$choice2~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:26:09,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 13:26:09,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In223875637 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In223875637 256)))) (or (= (mod ~x$w_buff0_used~0_In223875637 256) 0) (and .cse0 (= (mod ~x$w_buff1_used~0_In223875637 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In223875637 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite23_Out223875637| |P0Thread1of1ForFork2_#t~ite24_Out223875637|) (= |P0Thread1of1ForFork2_#t~ite23_Out223875637| ~x$r_buff1_thd1~0_In223875637) .cse1) (and (= ~x$r_buff1_thd1~0_In223875637 |P0Thread1of1ForFork2_#t~ite24_Out223875637|) (= |P0Thread1of1ForFork2_#t~ite23_In223875637| |P0Thread1of1ForFork2_#t~ite23_Out223875637|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In223875637, ~x$w_buff1_used~0=~x$w_buff1_used~0_In223875637, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In223875637, ~weak$$choice2~0=~weak$$choice2~0_In223875637, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In223875637|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223875637} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In223875637, ~x$w_buff1_used~0=~x$w_buff1_used~0_In223875637, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In223875637, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out223875637|, ~weak$$choice2~0=~weak$$choice2~0_In223875637, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out223875637|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223875637} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 13:26:09,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 13:26:09,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1271466478 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1271466478 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1271466478| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1271466478| ~x$w_buff0_used~0_In-1271466478) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1271466478, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1271466478} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1271466478, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1271466478|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1271466478} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 13:26:09,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-199922792 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-199922792 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-199922792 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-199922792 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-199922792|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-199922792| ~x$w_buff1_used~0_In-199922792) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-199922792, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-199922792, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-199922792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-199922792} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-199922792, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-199922792, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-199922792, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-199922792|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-199922792} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:26:09,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-1742228901 ~x$r_buff0_thd2~0_Out-1742228901)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1742228901 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1742228901 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out-1742228901) (not .cse2) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1742228901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1742228901} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1742228901|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1742228901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1742228901} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:26:09,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In542598042 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In542598042 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In542598042 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In542598042 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out542598042|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In542598042 |P1Thread1of1ForFork0_#t~ite31_Out542598042|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In542598042, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In542598042, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In542598042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In542598042} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out542598042|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542598042, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In542598042, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In542598042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In542598042} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:26:09,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 13:26:09,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_29) 1 0)) 0 1) v_~main$tmp_guard0~0_7) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:26:09,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-497456850 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-497456850 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-497456850| |ULTIMATE.start_main_#t~ite42_Out-497456850|))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-497456850| ~x~0_In-497456850) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite41_Out-497456850| ~x$w_buff1~0_In-497456850) (not .cse0) (not .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-497456850, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-497456850, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-497456850, ~x~0=~x~0_In-497456850} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-497456850|, ~x$w_buff1~0=~x$w_buff1~0_In-497456850, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-497456850, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-497456850, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-497456850|, ~x~0=~x~0_In-497456850} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:26:09,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In67515035 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In67515035 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out67515035| ~x$w_buff0_used~0_In67515035) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out67515035| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In67515035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In67515035} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In67515035, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out67515035|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In67515035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:26:09,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1923786861 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1923786861 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1923786861 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1923786861 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1923786861| 0)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1923786861 |ULTIMATE.start_main_#t~ite44_Out1923786861|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1923786861, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1923786861, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1923786861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1923786861} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1923786861, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1923786861, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1923786861, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1923786861|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1923786861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:26:09,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1179275121 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1179275121 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1179275121| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1179275121| ~x$r_buff0_thd0~0_In-1179275121) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1179275121, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1179275121} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1179275121, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1179275121|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1179275121} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:26:09,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1057340266 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1057340266 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1057340266 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1057340266 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-1057340266| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out-1057340266| ~x$r_buff1_thd0~0_In-1057340266)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1057340266, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1057340266, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1057340266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057340266} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1057340266, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1057340266|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1057340266, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1057340266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057340266} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 13:26:09,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= (ite (= (ite (not (and (= v_~z~0_43 2) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:26:09,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:26:09 BasicIcfg [2019-12-07 13:26:09,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:26:09,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:26:09,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:26:09,680 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:26:09,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:24:50" (3/4) ... [2019-12-07 13:26:09,682 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:26:09,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= v_~main$tmp_guard0~0_19 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30| 1)) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30|) |v_ULTIMATE.start_main_~#t2525~0.offset_17| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd1~0_390 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30|) 0) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2525~0.base_30| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t2525~0.offset_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2525~0.base_30|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_~#t2525~0.base=|v_ULTIMATE.start_main_~#t2525~0.base_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_24|, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_24|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ~weak$$choice0~0=v_~weak$$choice0~0_29, ULTIMATE.start_main_~#t2525~0.offset=|v_ULTIMATE.start_main_~#t2525~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2526~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2525~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2527~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2526~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2527~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2525~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 13:26:09,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2526~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t2526~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13|) |v_ULTIMATE.start_main_~#t2526~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2526~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2526~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2526~0.offset, ULTIMATE.start_main_~#t2526~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 13:26:09,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (= 1 v_~y~0_6) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:26:09,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2527~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13|) |v_ULTIMATE.start_main_~#t2527~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2527~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13| 1) |v_#valid_32|) (= 0 |v_ULTIMATE.start_main_~#t2527~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2527~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2527~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2527~0.offset] because there is no mapped edge [2019-12-07 13:26:09,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1363827512 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1363827512 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1363827512| ~x~0_In-1363827512)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1363827512| ~x$w_buff1~0_In-1363827512) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1363827512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1363827512, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1363827512, ~x~0=~x~0_In-1363827512} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1363827512|, ~x$w_buff1~0=~x$w_buff1~0_In-1363827512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1363827512, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1363827512, ~x~0=~x~0_In-1363827512} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 13:26:09,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 13:26:09,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1323070378 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1323070378 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1323070378| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1323070378 |P2Thread1of1ForFork1_#t~ite34_Out-1323070378|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1323070378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1323070378} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1323070378|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1323070378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1323070378} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:26:09,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In707603331 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In707603331 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In707603331 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In707603331 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out707603331|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In707603331 |P2Thread1of1ForFork1_#t~ite35_Out707603331|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In707603331, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In707603331, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In707603331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707603331} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out707603331|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In707603331, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In707603331, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In707603331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707603331} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:26:09,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2103668030 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-2103668030 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-2103668030| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-2103668030| ~x$r_buff0_thd3~0_In-2103668030)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2103668030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103668030} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2103668030|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2103668030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103668030} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:26:09,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1129319347 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1129319347 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1129319347 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1129319347 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In-1129319347 |P2Thread1of1ForFork1_#t~ite37_Out-1129319347|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1129319347|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1129319347, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1129319347, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1129319347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129319347} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1129319347|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1129319347, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1129319347, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1129319347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129319347} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:26:09,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_34|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:26:09,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1444683561 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out-1444683561| |P0Thread1of1ForFork2_#t~ite11_Out-1444683561|) .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out-1444683561| ~x$w_buff1~0_In-1444683561) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1444683561 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1444683561 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1444683561 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-1444683561 256) 0) .cse1)))) (and (= |P0Thread1of1ForFork2_#t~ite11_In-1444683561| |P0Thread1of1ForFork2_#t~ite11_Out-1444683561|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out-1444683561| ~x$w_buff1~0_In-1444683561)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1444683561, ~x$w_buff1~0=~x$w_buff1~0_In-1444683561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1444683561, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1444683561, ~weak$$choice2~0=~weak$$choice2~0_In-1444683561, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1444683561|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1444683561} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1444683561, ~x$w_buff1~0=~x$w_buff1~0_In-1444683561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1444683561, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1444683561, ~weak$$choice2~0=~weak$$choice2~0_In-1444683561, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1444683561|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1444683561|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1444683561} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:26:09,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-73836390 256)))) (or (and (= ~x$w_buff0_used~0_In-73836390 |P0Thread1of1ForFork2_#t~ite14_Out-73836390|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-73836390 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In-73836390 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In-73836390 256) 0) (and (= (mod ~x$w_buff1_used~0_In-73836390 256) 0) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite15_Out-73836390| |P0Thread1of1ForFork2_#t~ite14_Out-73836390|)) (and (= ~x$w_buff0_used~0_In-73836390 |P0Thread1of1ForFork2_#t~ite15_Out-73836390|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In-73836390| |P0Thread1of1ForFork2_#t~ite14_Out-73836390|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-73836390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73836390, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-73836390, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-73836390|, ~weak$$choice2~0=~weak$$choice2~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-73836390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73836390, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-73836390|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-73836390, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-73836390|, ~weak$$choice2~0=~weak$$choice2~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:26:09,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 13:26:09,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In223875637 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In223875637 256)))) (or (= (mod ~x$w_buff0_used~0_In223875637 256) 0) (and .cse0 (= (mod ~x$w_buff1_used~0_In223875637 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In223875637 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite23_Out223875637| |P0Thread1of1ForFork2_#t~ite24_Out223875637|) (= |P0Thread1of1ForFork2_#t~ite23_Out223875637| ~x$r_buff1_thd1~0_In223875637) .cse1) (and (= ~x$r_buff1_thd1~0_In223875637 |P0Thread1of1ForFork2_#t~ite24_Out223875637|) (= |P0Thread1of1ForFork2_#t~ite23_In223875637| |P0Thread1of1ForFork2_#t~ite23_Out223875637|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In223875637, ~x$w_buff1_used~0=~x$w_buff1_used~0_In223875637, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In223875637, ~weak$$choice2~0=~weak$$choice2~0_In223875637, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In223875637|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223875637} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In223875637, ~x$w_buff1_used~0=~x$w_buff1_used~0_In223875637, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In223875637, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out223875637|, ~weak$$choice2~0=~weak$$choice2~0_In223875637, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out223875637|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223875637} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 13:26:09,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 13:26:09,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1271466478 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1271466478 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1271466478| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1271466478| ~x$w_buff0_used~0_In-1271466478) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1271466478, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1271466478} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1271466478, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1271466478|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1271466478} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 13:26:09,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-199922792 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-199922792 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-199922792 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-199922792 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-199922792|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-199922792| ~x$w_buff1_used~0_In-199922792) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-199922792, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-199922792, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-199922792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-199922792} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-199922792, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-199922792, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-199922792, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-199922792|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-199922792} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:26:09,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-1742228901 ~x$r_buff0_thd2~0_Out-1742228901)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1742228901 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1742228901 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out-1742228901) (not .cse2) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1742228901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1742228901} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1742228901|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1742228901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1742228901} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:26:09,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In542598042 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In542598042 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In542598042 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In542598042 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out542598042|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In542598042 |P1Thread1of1ForFork0_#t~ite31_Out542598042|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In542598042, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In542598042, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In542598042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In542598042} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out542598042|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542598042, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In542598042, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In542598042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In542598042} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:26:09,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 13:26:09,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_29) 1 0)) 0 1) v_~main$tmp_guard0~0_7) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:26:09,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-497456850 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-497456850 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-497456850| |ULTIMATE.start_main_#t~ite42_Out-497456850|))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-497456850| ~x~0_In-497456850) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite41_Out-497456850| ~x$w_buff1~0_In-497456850) (not .cse0) (not .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-497456850, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-497456850, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-497456850, ~x~0=~x~0_In-497456850} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-497456850|, ~x$w_buff1~0=~x$w_buff1~0_In-497456850, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-497456850, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-497456850, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-497456850|, ~x~0=~x~0_In-497456850} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:26:09,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In67515035 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In67515035 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out67515035| ~x$w_buff0_used~0_In67515035) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out67515035| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In67515035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In67515035} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In67515035, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out67515035|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In67515035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:26:09,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1923786861 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1923786861 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1923786861 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1923786861 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1923786861| 0)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1923786861 |ULTIMATE.start_main_#t~ite44_Out1923786861|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1923786861, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1923786861, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1923786861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1923786861} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1923786861, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1923786861, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1923786861, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1923786861|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1923786861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:26:09,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1179275121 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1179275121 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1179275121| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1179275121| ~x$r_buff0_thd0~0_In-1179275121) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1179275121, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1179275121} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1179275121, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1179275121|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1179275121} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:26:09,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1057340266 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1057340266 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1057340266 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1057340266 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-1057340266| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out-1057340266| ~x$r_buff1_thd0~0_In-1057340266)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1057340266, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1057340266, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1057340266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057340266} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1057340266, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1057340266|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1057340266, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1057340266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057340266} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 13:26:09,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= (ite (= (ite (not (and (= v_~z~0_43 2) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:26:09,740 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a718d559-8c94-48a9-a909-ccf980fd00f5/bin/uautomizer/witness.graphml [2019-12-07 13:26:09,740 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:26:09,741 INFO L168 Benchmark]: Toolchain (without parser) took 80216.80 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 934.4 MB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 904.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:09,742 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:26:09,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:09,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.85 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:09,742 INFO L168 Benchmark]: Boogie Preprocessor took 29.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:26:09,742 INFO L168 Benchmark]: RCFGBuilder took 402.00 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: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:09,743 INFO L168 Benchmark]: TraceAbstraction took 79311.20 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 822.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:09,743 INFO L168 Benchmark]: Witness Printer took 61.03 ms. Allocated memory is still 6.5 GB. Free memory was 5.5 GB in the beginning and 5.5 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:09,744 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.85 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 402.00 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: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79311.20 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 822.5 MB. Max. memory is 11.5 GB. * Witness Printer took 61.03 ms. Allocated memory is still 6.5 GB. Free memory was 5.5 GB in the beginning and 5.5 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6611 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 125 SemBasedMoverChecksPositive, 244 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 64880 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 79.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3273 SDtfs, 3183 SDslu, 6235 SDs, 0 SdLazy, 3689 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250613occurred 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: 52.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 165957 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 645 NumberOfCodeBlocks, 645 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 569 ConstructedInterpolants, 0 QuantifiedInterpolants, 100112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...