./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_pso.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_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/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 505fb37105e1e4dae473580a9797f1e7f137df28 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:48:46,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:48:46,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:48:46,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:48:46,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:48:46,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:48:46,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:48:46,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:48:46,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:48:46,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:48:46,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:48:46,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:48:46,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:48:46,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:48:46,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:48:46,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:48:46,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:48:46,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:48:46,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:48:46,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:48:46,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:48:46,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:48:46,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:48:46,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:48:46,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:48:46,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:48:46,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:48:46,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:48:46,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:48:46,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:48:46,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:48:46,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:48:46,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:48:46,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:48:46,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:48:46,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:48:46,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:48:46,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:48:46,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:48:46,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:48:46,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:48:46,741 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:48:46,752 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:48:46,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:48:46,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:48:46,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:48:46,753 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:48:46,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:48:46,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:48:46,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:48:46,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:48:46,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:48:46,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:48:46,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:48:46,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:48:46,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:48:46,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:48:46,755 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:48:46,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:48:46,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:48:46,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:48:46,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:48:46,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:48:46,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:48:46,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:48:46,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:48:46,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:48:46,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:48:46,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:48:46,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:48:46,757 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:48:46,757 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_33957fd1-8edd-4bdc-82e0-28d78f102912/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 -> 505fb37105e1e4dae473580a9797f1e7f137df28 [2019-12-07 10:48:46,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:48:46,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:48:46,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:48:46,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:48:46,885 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:48:46,885 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc.i [2019-12-07 10:48:46,931 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/data/01df5e991/34ef535b3350481e9f3a46eeeb0f8e25/FLAGe954f6dc2 [2019-12-07 10:48:47,417 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:48:47,418 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc.i [2019-12-07 10:48:47,429 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/data/01df5e991/34ef535b3350481e9f3a46eeeb0f8e25/FLAGe954f6dc2 [2019-12-07 10:48:47,437 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/data/01df5e991/34ef535b3350481e9f3a46eeeb0f8e25 [2019-12-07 10:48:47,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:48:47,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:48:47,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:48:47,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:48:47,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:48:47,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43650ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47, skipping insertion in model container [2019-12-07 10:48:47,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:48:47,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:48:47,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:48:47,723 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:48:47,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:48:47,806 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:48:47,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47 WrapperNode [2019-12-07 10:48:47,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:48:47,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:48:47,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:48:47,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:48:47,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:48:47,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:48:47,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:48:47,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:48:47,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... [2019-12-07 10:48:47,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:48:47,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:48:47,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:48:47,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:48:47,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/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 10:48:47,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:48:47,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:48:47,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:48:47,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:48:47,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:48:47,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:48:47,911 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:48:47,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:48:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:48:47,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:48:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:48:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:48:47,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:48:47,913 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 10:48:48,261 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:48:48,262 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:48:48,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:48:48 BoogieIcfgContainer [2019-12-07 10:48:48,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:48:48,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:48:48,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:48:48,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:48:48,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:48:47" (1/3) ... [2019-12-07 10:48:48,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38afd389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:48:48, skipping insertion in model container [2019-12-07 10:48:48,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:48:47" (2/3) ... [2019-12-07 10:48:48,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38afd389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:48:48, skipping insertion in model container [2019-12-07 10:48:48,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:48:48" (3/3) ... [2019-12-07 10:48:48,267 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc.i [2019-12-07 10:48:48,273 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:48:48,273 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:48:48,277 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:48:48,278 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:48:48,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,314 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:48:48,331 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:48:48,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:48:48,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:48:48,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:48:48,343 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:48:48,343 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:48:48,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:48:48,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:48:48,344 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:48:48,355 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 10:48:48,356 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 10:48:48,409 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 10:48:48,409 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:48:48,419 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 724 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 10:48:48,434 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 10:48:48,462 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 10:48:48,463 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:48:48,467 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 724 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 10:48:48,481 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 10:48:48,481 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:48:51,504 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 10:48:51,643 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-07 10:48:51,643 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 10:48:51,646 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-07 10:49:00,011 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-07 10:49:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-07 10:49:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:49:00,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:00,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:49:00,017 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 10:49:00,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-07 10:49:00,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:00,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072639696] [2019-12-07 10:49:00,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:00,171 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 10:49:00,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072639696] [2019-12-07 10:49:00,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:00,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:49:00,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289118032] [2019-12-07 10:49:00,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:49:00,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:00,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:49:00,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:49:00,187 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-07 10:49:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:00,830 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-07 10:49:00,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:49:00,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:49:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:01,211 INFO L225 Difference]: With dead ends: 79136 [2019-12-07 10:49:01,211 INFO L226 Difference]: Without dead ends: 74600 [2019-12-07 10:49:01,212 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 10:49:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-07 10:49:05,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-07 10:49:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-07 10:49:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-07 10:49:05,318 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-07 10:49:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:05,319 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-07 10:49:05,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:49:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-07 10:49:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:49:05,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:05,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:49:05,325 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 10:49:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-07 10:49:05,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:05,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421507418] [2019-12-07 10:49:05,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:05,394 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 10:49:05,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421507418] [2019-12-07 10:49:05,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:05,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:49:05,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968618323] [2019-12-07 10:49:05,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:49:05,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:05,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:49:05,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:49:05,396 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-07 10:49:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:06,222 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-07 10:49:06,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:49:06,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:49:06,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:06,545 INFO L225 Difference]: With dead ends: 114840 [2019-12-07 10:49:06,545 INFO L226 Difference]: Without dead ends: 114749 [2019-12-07 10:49:06,546 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 10:49:11,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-07 10:49:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-07 10:49:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-07 10:49:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-07 10:49:13,026 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-07 10:49:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:13,027 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-07 10:49:13,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:49:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-07 10:49:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:49:13,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:13,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:49:13,030 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 10:49:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:13,031 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-07 10:49:13,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:13,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753662603] [2019-12-07 10:49:13,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:13,073 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 10:49:13,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753662603] [2019-12-07 10:49:13,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:13,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:49:13,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898630932] [2019-12-07 10:49:13,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:49:13,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:13,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:49:13,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:49:13,074 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-07 10:49:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:14,065 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-07 10:49:14,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:49:14,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:49:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:14,421 INFO L225 Difference]: With dead ends: 148763 [2019-12-07 10:49:14,421 INFO L226 Difference]: Without dead ends: 148659 [2019-12-07 10:49:14,422 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 10:49:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-07 10:49:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-07 10:49:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-07 10:49:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-07 10:49:22,427 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-07 10:49:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:22,427 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-07 10:49:22,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:49:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-07 10:49:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:49:22,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:22,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:49:22,430 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 10:49:22,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-07 10:49:22,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:22,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079110883] [2019-12-07 10:49:22,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:22,477 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 10:49:22,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079110883] [2019-12-07 10:49:22,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:22,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:49:22,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707332549] [2019-12-07 10:49:22,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:49:22,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:22,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:49:22,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:49:22,479 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-07 10:49:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:23,324 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-07 10:49:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:49:23,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:49:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:23,748 INFO L225 Difference]: With dead ends: 172949 [2019-12-07 10:49:23,748 INFO L226 Difference]: Without dead ends: 172813 [2019-12-07 10:49:23,748 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 10:49:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-07 10:49:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-07 10:49:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-07 10:49:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-07 10:49:30,171 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-07 10:49:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:30,172 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-07 10:49:30,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:49:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-07 10:49:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:49:30,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:30,187 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 10:49:30,187 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 10:49:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:30,187 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-07 10:49:30,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:30,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126223794] [2019-12-07 10:49:30,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:30,227 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 10:49:30,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126223794] [2019-12-07 10:49:30,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:30,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:49:30,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164500191] [2019-12-07 10:49:30,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:49:30,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:30,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:49:30,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:49:30,229 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 3 states. [2019-12-07 10:49:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:30,720 INFO L93 Difference]: Finished difference Result 126643 states and 516706 transitions. [2019-12-07 10:49:30,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:49:30,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:49:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:31,032 INFO L225 Difference]: With dead ends: 126643 [2019-12-07 10:49:31,032 INFO L226 Difference]: Without dead ends: 126643 [2019-12-07 10:49:31,032 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 10:49:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126643 states. [2019-12-07 10:49:35,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126643 to 124663. [2019-12-07 10:49:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124663 states. [2019-12-07 10:49:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124663 states to 124663 states and 509164 transitions. [2019-12-07 10:49:36,272 INFO L78 Accepts]: Start accepts. Automaton has 124663 states and 509164 transitions. Word has length 18 [2019-12-07 10:49:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:36,273 INFO L462 AbstractCegarLoop]: Abstraction has 124663 states and 509164 transitions. [2019-12-07 10:49:36,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:49:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 124663 states and 509164 transitions. [2019-12-07 10:49:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:49:36,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:36,282 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 10:49:36,282 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 10:49:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash -750857681, now seen corresponding path program 1 times [2019-12-07 10:49:36,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:36,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548279639] [2019-12-07 10:49:36,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:36,332 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 10:49:36,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548279639] [2019-12-07 10:49:36,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:36,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:49:36,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808250577] [2019-12-07 10:49:36,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:49:36,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:49:36,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:49:36,334 INFO L87 Difference]: Start difference. First operand 124663 states and 509164 transitions. Second operand 3 states. [2019-12-07 10:49:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:36,848 INFO L93 Difference]: Finished difference Result 125471 states and 511181 transitions. [2019-12-07 10:49:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:49:36,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:49:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:37,171 INFO L225 Difference]: With dead ends: 125471 [2019-12-07 10:49:37,172 INFO L226 Difference]: Without dead ends: 125471 [2019-12-07 10:49:37,172 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 10:49:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125471 states. [2019-12-07 10:49:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125471 to 124638. [2019-12-07 10:49:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124638 states. [2019-12-07 10:49:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124638 states to 124638 states and 509065 transitions. [2019-12-07 10:49:43,655 INFO L78 Accepts]: Start accepts. Automaton has 124638 states and 509065 transitions. Word has length 18 [2019-12-07 10:49:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:43,655 INFO L462 AbstractCegarLoop]: Abstraction has 124638 states and 509065 transitions. [2019-12-07 10:49:43,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:49:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 124638 states and 509065 transitions. [2019-12-07 10:49:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:49:43,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:43,667 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 10:49:43,667 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 10:49:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1446946605, now seen corresponding path program 1 times [2019-12-07 10:49:43,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:43,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114708233] [2019-12-07 10:49:43,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:43,709 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 10:49:43,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114708233] [2019-12-07 10:49:43,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:43,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:49:43,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762378521] [2019-12-07 10:49:43,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:49:43,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:49:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:49:43,711 INFO L87 Difference]: Start difference. First operand 124638 states and 509065 transitions. Second operand 4 states. [2019-12-07 10:49:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:43,826 INFO L93 Difference]: Finished difference Result 34838 states and 120677 transitions. [2019-12-07 10:49:43,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:49:43,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 10:49:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:43,872 INFO L225 Difference]: With dead ends: 34838 [2019-12-07 10:49:43,873 INFO L226 Difference]: Without dead ends: 27384 [2019-12-07 10:49:43,873 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 10:49:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27384 states. [2019-12-07 10:49:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27384 to 27383. [2019-12-07 10:49:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27383 states. [2019-12-07 10:49:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27383 states to 27383 states and 90628 transitions. [2019-12-07 10:49:44,598 INFO L78 Accepts]: Start accepts. Automaton has 27383 states and 90628 transitions. Word has length 19 [2019-12-07 10:49:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:44,598 INFO L462 AbstractCegarLoop]: Abstraction has 27383 states and 90628 transitions. [2019-12-07 10:49:44,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:49:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 27383 states and 90628 transitions. [2019-12-07 10:49:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:49:44,603 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:44,604 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 10:49:44,604 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 10:49:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-07 10:49:44,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:44,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935595884] [2019-12-07 10:49:44,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:44,653 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 10:49:44,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935595884] [2019-12-07 10:49:44,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:44,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:49:44,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230397837] [2019-12-07 10:49:44,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:49:44,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:44,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:49:44,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:49:44,654 INFO L87 Difference]: Start difference. First operand 27383 states and 90628 transitions. Second operand 6 states. [2019-12-07 10:49:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:45,136 INFO L93 Difference]: Finished difference Result 43124 states and 139529 transitions. [2019-12-07 10:49:45,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:49:45,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:49:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:45,198 INFO L225 Difference]: With dead ends: 43124 [2019-12-07 10:49:45,199 INFO L226 Difference]: Without dead ends: 42695 [2019-12-07 10:49:45,199 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 10:49:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42695 states. [2019-12-07 10:49:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42695 to 28114. [2019-12-07 10:49:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28114 states. [2019-12-07 10:49:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28114 states to 28114 states and 92437 transitions. [2019-12-07 10:49:45,774 INFO L78 Accepts]: Start accepts. Automaton has 28114 states and 92437 transitions. Word has length 22 [2019-12-07 10:49:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:45,774 INFO L462 AbstractCegarLoop]: Abstraction has 28114 states and 92437 transitions. [2019-12-07 10:49:45,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:49:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 28114 states and 92437 transitions. [2019-12-07 10:49:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:49:45,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:45,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] [2019-12-07 10:49:45,783 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 10:49:45,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:45,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1172052689, now seen corresponding path program 1 times [2019-12-07 10:49:45,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:45,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519901361] [2019-12-07 10:49:45,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:45,826 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 10:49:45,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519901361] [2019-12-07 10:49:45,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:45,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:49:45,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987239937] [2019-12-07 10:49:45,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:49:45,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:45,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:49:45,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:49:45,828 INFO L87 Difference]: Start difference. First operand 28114 states and 92437 transitions. Second operand 5 states. [2019-12-07 10:49:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:45,900 INFO L93 Difference]: Finished difference Result 12121 states and 37659 transitions. [2019-12-07 10:49:45,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:49:45,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 10:49:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:45,917 INFO L225 Difference]: With dead ends: 12121 [2019-12-07 10:49:45,917 INFO L226 Difference]: Without dead ends: 10434 [2019-12-07 10:49:45,917 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 10:49:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10434 states. [2019-12-07 10:49:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10434 to 10434. [2019-12-07 10:49:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10434 states. [2019-12-07 10:49:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10434 states to 10434 states and 32175 transitions. [2019-12-07 10:49:46,062 INFO L78 Accepts]: Start accepts. Automaton has 10434 states and 32175 transitions. Word has length 25 [2019-12-07 10:49:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:46,062 INFO L462 AbstractCegarLoop]: Abstraction has 10434 states and 32175 transitions. [2019-12-07 10:49:46,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:49:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 10434 states and 32175 transitions. [2019-12-07 10:49:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:49:46,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:46,076 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 10:49:46,076 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 10:49:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:46,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-07 10:49:46,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:46,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847351076] [2019-12-07 10:49:46,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:46,154 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 10:49:46,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847351076] [2019-12-07 10:49:46,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:46,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:49:46,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924956199] [2019-12-07 10:49:46,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:49:46,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:46,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:49:46,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:49:46,155 INFO L87 Difference]: Start difference. First operand 10434 states and 32175 transitions. Second operand 7 states. [2019-12-07 10:49:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:46,818 INFO L93 Difference]: Finished difference Result 14341 states and 42472 transitions. [2019-12-07 10:49:46,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:49:46,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 10:49:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:46,833 INFO L225 Difference]: With dead ends: 14341 [2019-12-07 10:49:46,833 INFO L226 Difference]: Without dead ends: 14337 [2019-12-07 10:49:46,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:49:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14337 states. [2019-12-07 10:49:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14337 to 10729. [2019-12-07 10:49:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10729 states. [2019-12-07 10:49:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10729 states to 10729 states and 32835 transitions. [2019-12-07 10:49:46,994 INFO L78 Accepts]: Start accepts. Automaton has 10729 states and 32835 transitions. Word has length 40 [2019-12-07 10:49:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:46,994 INFO L462 AbstractCegarLoop]: Abstraction has 10729 states and 32835 transitions. [2019-12-07 10:49:46,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:49:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 10729 states and 32835 transitions. [2019-12-07 10:49:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:49:47,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:47,007 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 10:49:47,007 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 10:49:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:47,007 INFO L82 PathProgramCache]: Analyzing trace with hash 286042565, now seen corresponding path program 1 times [2019-12-07 10:49:47,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:47,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072190957] [2019-12-07 10:49:47,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:47,042 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 10:49:47,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072190957] [2019-12-07 10:49:47,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:47,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:49:47,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702592126] [2019-12-07 10:49:47,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:49:47,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:49:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:49:47,043 INFO L87 Difference]: Start difference. First operand 10729 states and 32835 transitions. Second operand 3 states. [2019-12-07 10:49:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:47,072 INFO L93 Difference]: Finished difference Result 10299 states and 31082 transitions. [2019-12-07 10:49:47,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:49:47,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 10:49:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:47,083 INFO L225 Difference]: With dead ends: 10299 [2019-12-07 10:49:47,083 INFO L226 Difference]: Without dead ends: 10299 [2019-12-07 10:49:47,084 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 10:49:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10299 states. [2019-12-07 10:49:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10299 to 10051. [2019-12-07 10:49:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10051 states. [2019-12-07 10:49:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10051 states to 10051 states and 30382 transitions. [2019-12-07 10:49:47,215 INFO L78 Accepts]: Start accepts. Automaton has 10051 states and 30382 transitions. Word has length 40 [2019-12-07 10:49:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:47,216 INFO L462 AbstractCegarLoop]: Abstraction has 10051 states and 30382 transitions. [2019-12-07 10:49:47,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:49:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 10051 states and 30382 transitions. [2019-12-07 10:49:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:49:47,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:47,227 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 10:49:47,227 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 10:49:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash -239200763, now seen corresponding path program 1 times [2019-12-07 10:49:47,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:47,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157059379] [2019-12-07 10:49:47,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:47,275 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 10:49:47,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157059379] [2019-12-07 10:49:47,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:47,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:49:47,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415798808] [2019-12-07 10:49:47,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:49:47,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:47,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:49:47,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:49:47,277 INFO L87 Difference]: Start difference. First operand 10051 states and 30382 transitions. Second operand 4 states. [2019-12-07 10:49:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:47,304 INFO L93 Difference]: Finished difference Result 10049 states and 30378 transitions. [2019-12-07 10:49:47,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:49:47,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 10:49:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:47,315 INFO L225 Difference]: With dead ends: 10049 [2019-12-07 10:49:47,315 INFO L226 Difference]: Without dead ends: 10049 [2019-12-07 10:49:47,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 10:49:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10049 states. [2019-12-07 10:49:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10049 to 10049. [2019-12-07 10:49:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10049 states. [2019-12-07 10:49:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10049 states to 10049 states and 30378 transitions. [2019-12-07 10:49:47,443 INFO L78 Accepts]: Start accepts. Automaton has 10049 states and 30378 transitions. Word has length 41 [2019-12-07 10:49:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:47,444 INFO L462 AbstractCegarLoop]: Abstraction has 10049 states and 30378 transitions. [2019-12-07 10:49:47,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:49:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 10049 states and 30378 transitions. [2019-12-07 10:49:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:49:47,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:47,454 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 10:49:47,454 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 10:49:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:47,455 INFO L82 PathProgramCache]: Analyzing trace with hash 717510369, now seen corresponding path program 1 times [2019-12-07 10:49:47,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:47,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904063756] [2019-12-07 10:49:47,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:47,491 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 10:49:47,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904063756] [2019-12-07 10:49:47,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:47,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:49:47,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441941712] [2019-12-07 10:49:47,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:49:47,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:47,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:49:47,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:49:47,492 INFO L87 Difference]: Start difference. First operand 10049 states and 30378 transitions. Second operand 4 states. [2019-12-07 10:49:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:47,536 INFO L93 Difference]: Finished difference Result 18351 states and 55345 transitions. [2019-12-07 10:49:47,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:49:47,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 10:49:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:47,545 INFO L225 Difference]: With dead ends: 18351 [2019-12-07 10:49:47,545 INFO L226 Difference]: Without dead ends: 8723 [2019-12-07 10:49:47,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:49:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2019-12-07 10:49:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 8723. [2019-12-07 10:49:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8723 states. [2019-12-07 10:49:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8723 states to 8723 states and 26064 transitions. [2019-12-07 10:49:47,658 INFO L78 Accepts]: Start accepts. Automaton has 8723 states and 26064 transitions. Word has length 42 [2019-12-07 10:49:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:47,659 INFO L462 AbstractCegarLoop]: Abstraction has 8723 states and 26064 transitions. [2019-12-07 10:49:47,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:49:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 8723 states and 26064 transitions. [2019-12-07 10:49:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:49:47,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:47,665 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 10:49:47,665 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 10:49:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash -598466109, now seen corresponding path program 2 times [2019-12-07 10:49:47,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:47,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434536948] [2019-12-07 10:49:47,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:47,720 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 10:49:47,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434536948] [2019-12-07 10:49:47,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:47,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:49:47,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856905649] [2019-12-07 10:49:47,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:49:47,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:47,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:49:47,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:49:47,721 INFO L87 Difference]: Start difference. First operand 8723 states and 26064 transitions. Second operand 6 states. [2019-12-07 10:49:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:47,787 INFO L93 Difference]: Finished difference Result 7581 states and 23337 transitions. [2019-12-07 10:49:47,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:49:47,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 10:49:47,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:47,795 INFO L225 Difference]: With dead ends: 7581 [2019-12-07 10:49:47,795 INFO L226 Difference]: Without dead ends: 7475 [2019-12-07 10:49:47,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:49:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7475 states. [2019-12-07 10:49:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7475 to 7391. [2019-12-07 10:49:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2019-12-07 10:49:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 22863 transitions. [2019-12-07 10:49:47,900 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 22863 transitions. Word has length 42 [2019-12-07 10:49:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:47,900 INFO L462 AbstractCegarLoop]: Abstraction has 7391 states and 22863 transitions. [2019-12-07 10:49:47,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:49:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 22863 transitions. [2019-12-07 10:49:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:49:47,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:47,906 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 10:49:47,907 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 10:49:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1916857338, now seen corresponding path program 1 times [2019-12-07 10:49:47,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:47,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111450888] [2019-12-07 10:49:47,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:47,930 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 10:49:47,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111450888] [2019-12-07 10:49:47,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:47,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:49:47,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012314223] [2019-12-07 10:49:47,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:49:47,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:47,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:49:47,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:49:47,931 INFO L87 Difference]: Start difference. First operand 7391 states and 22863 transitions. Second operand 3 states. [2019-12-07 10:49:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:47,981 INFO L93 Difference]: Finished difference Result 10175 states and 30901 transitions. [2019-12-07 10:49:47,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:49:47,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 10:49:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:47,992 INFO L225 Difference]: With dead ends: 10175 [2019-12-07 10:49:47,992 INFO L226 Difference]: Without dead ends: 10175 [2019-12-07 10:49:47,993 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 10:49:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10175 states. [2019-12-07 10:49:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10175 to 7795. [2019-12-07 10:49:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7795 states. [2019-12-07 10:49:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7795 states to 7795 states and 24155 transitions. [2019-12-07 10:49:48,113 INFO L78 Accepts]: Start accepts. Automaton has 7795 states and 24155 transitions. Word has length 56 [2019-12-07 10:49:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:48,113 INFO L462 AbstractCegarLoop]: Abstraction has 7795 states and 24155 transitions. [2019-12-07 10:49:48,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:49:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7795 states and 24155 transitions. [2019-12-07 10:49:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:49:48,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:48,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:49:48,120 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 10:49:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:48,120 INFO L82 PathProgramCache]: Analyzing trace with hash -261820410, now seen corresponding path program 1 times [2019-12-07 10:49:48,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:48,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216334311] [2019-12-07 10:49:48,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:48,264 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 10:49:48,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216334311] [2019-12-07 10:49:48,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:48,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:49:48,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279763832] [2019-12-07 10:49:48,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:49:48,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:48,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:49:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:49:48,266 INFO L87 Difference]: Start difference. First operand 7795 states and 24155 transitions. Second operand 11 states. [2019-12-07 10:49:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:49,297 INFO L93 Difference]: Finished difference Result 23552 states and 73027 transitions. [2019-12-07 10:49:49,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 10:49:49,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 10:49:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:49,313 INFO L225 Difference]: With dead ends: 23552 [2019-12-07 10:49:49,313 INFO L226 Difference]: Without dead ends: 15912 [2019-12-07 10:49:49,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 10:49:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15912 states. [2019-12-07 10:49:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15912 to 9785. [2019-12-07 10:49:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9785 states. [2019-12-07 10:49:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9785 states to 9785 states and 30031 transitions. [2019-12-07 10:49:49,477 INFO L78 Accepts]: Start accepts. Automaton has 9785 states and 30031 transitions. Word has length 56 [2019-12-07 10:49:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:49,477 INFO L462 AbstractCegarLoop]: Abstraction has 9785 states and 30031 transitions. [2019-12-07 10:49:49,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:49:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 9785 states and 30031 transitions. [2019-12-07 10:49:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:49:49,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:49,485 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 10:49:49,485 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 10:49:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 2 times [2019-12-07 10:49:49,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:49,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599180860] [2019-12-07 10:49:49,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:49,617 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 10:49:49,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599180860] [2019-12-07 10:49:49,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:49,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:49:49,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986427506] [2019-12-07 10:49:49,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:49:49,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:49:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:49:49,618 INFO L87 Difference]: Start difference. First operand 9785 states and 30031 transitions. Second operand 12 states. [2019-12-07 10:49:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:50,271 INFO L93 Difference]: Finished difference Result 16272 states and 49324 transitions. [2019-12-07 10:49:50,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 10:49:50,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 10:49:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:50,289 INFO L225 Difference]: With dead ends: 16272 [2019-12-07 10:49:50,289 INFO L226 Difference]: Without dead ends: 15620 [2019-12-07 10:49:50,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 10:49:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15620 states. [2019-12-07 10:49:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15620 to 9589. [2019-12-07 10:49:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9589 states. [2019-12-07 10:49:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9589 states to 9589 states and 29465 transitions. [2019-12-07 10:49:50,459 INFO L78 Accepts]: Start accepts. Automaton has 9589 states and 29465 transitions. Word has length 56 [2019-12-07 10:49:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:50,459 INFO L462 AbstractCegarLoop]: Abstraction has 9589 states and 29465 transitions. [2019-12-07 10:49:50,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:49:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 9589 states and 29465 transitions. [2019-12-07 10:49:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:49:50,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:50,467 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 10:49:50,468 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 10:49:50,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 3 times [2019-12-07 10:49:50,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:50,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084655340] [2019-12-07 10:49:50,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:49:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:49:50,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:49:50,528 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:49:50,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= v_~y~0_203 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25|)) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25| 1)) (= v_~x$mem_tmp~0_35 0) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (= 0 |v_ULTIMATE.start_main_~#t2055~0.offset_19|) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| 4)) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25|) |v_ULTIMATE.start_main_~#t2055~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff1_thd3~0_254) (= v_~main$tmp_guard0~0_48 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2055~0.base_25|) (= 0 v_~x~0_230) (= v_~weak$$choice2~0_176 0) (= v_~x$r_buff0_thd1~0_365 0) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_~#t2055~0.base=|v_ULTIMATE.start_main_~#t2055~0.base_25|, ULTIMATE.start_main_~#t2055~0.offset=|v_ULTIMATE.start_main_~#t2055~0.offset_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_203, ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2056~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2057~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2055~0.base, ULTIMATE.start_main_~#t2055~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2057~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2056~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:49:50,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2056~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= |v_ULTIMATE.start_main_~#t2056~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10|) |v_ULTIMATE.start_main_~#t2056~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2056~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2056~0.base] because there is no mapped edge [2019-12-07 10:49:50,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2057~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11|) |v_ULTIMATE.start_main_~#t2057~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2057~0.base_11| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t2057~0.offset_10| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2057~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2057~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:49:50,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) (not (= (mod v_~x$w_buff0_used~0_105 256) 0)))) 1 0)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 10:49:50,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1630116581 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1630116581 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In1630116581 |P2Thread1of1ForFork1_#t~ite32_Out1630116581|)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out1630116581| ~x$w_buff1~0_In1630116581) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1630116581, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1630116581, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1630116581, ~x~0=~x~0_In1630116581} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1630116581|, ~x$w_buff1~0=~x$w_buff1~0_In1630116581, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1630116581, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1630116581, ~x~0=~x~0_In1630116581} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 10:49:50,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 10:49:50,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In947356831 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In947356831 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out947356831|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In947356831 |P2Thread1of1ForFork1_#t~ite34_Out947356831|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In947356831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In947356831} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out947356831|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In947356831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In947356831} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 10:49:50,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-82572365 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-82572365 256) 0))) (or (and (= ~x$w_buff0_used~0_In-82572365 |P1Thread1of1ForFork0_#t~ite28_Out-82572365|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-82572365|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-82572365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-82572365} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-82572365, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-82572365|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-82572365} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:49:50,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1381200 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1381200 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1381200 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1381200 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1381200 |P1Thread1of1ForFork0_#t~ite29_Out-1381200|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1381200|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1381200, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1381200, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1381200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1381200} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1381200, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1381200, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1381200, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1381200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1381200} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:49:50,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-103038283 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out-103038283| |P0Thread1of1ForFork2_#t~ite9_Out-103038283|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-103038283 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-103038283 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-103038283 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-103038283 256))))) (= |P0Thread1of1ForFork2_#t~ite8_Out-103038283| ~x$w_buff0~0_In-103038283)) (and (= |P0Thread1of1ForFork2_#t~ite8_In-103038283| |P0Thread1of1ForFork2_#t~ite8_Out-103038283|) (= ~x$w_buff0~0_In-103038283 |P0Thread1of1ForFork2_#t~ite9_Out-103038283|) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-103038283, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-103038283, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-103038283|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-103038283, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-103038283, ~weak$$choice2~0=~weak$$choice2~0_In-103038283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-103038283} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-103038283, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-103038283, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-103038283|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-103038283, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-103038283|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-103038283, ~weak$$choice2~0=~weak$$choice2~0_In-103038283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-103038283} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 10:49:50,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1242636421 256)))) (or (and (= ~x$w_buff0_used~0_In-1242636421 |P0Thread1of1ForFork2_#t~ite15_Out-1242636421|) (= |P0Thread1of1ForFork2_#t~ite14_In-1242636421| |P0Thread1of1ForFork2_#t~ite14_Out-1242636421|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out-1242636421| |P0Thread1of1ForFork2_#t~ite14_Out-1242636421|) (= ~x$w_buff0_used~0_In-1242636421 |P0Thread1of1ForFork2_#t~ite14_Out-1242636421|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1242636421 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-1242636421 256) 0)) (= (mod ~x$w_buff0_used~0_In-1242636421 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1242636421 256))))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1242636421, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1242636421, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1242636421, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1242636421|, ~weak$$choice2~0=~weak$$choice2~0_In-1242636421, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1242636421} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1242636421, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1242636421, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1242636421|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1242636421, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1242636421|, ~weak$$choice2~0=~weak$$choice2~0_In-1242636421, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1242636421} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 10:49:50,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In938215268 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In938215268| |P0Thread1of1ForFork2_#t~ite17_Out938215268|) (= ~x$w_buff1_used~0_In938215268 |P0Thread1of1ForFork2_#t~ite18_Out938215268|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In938215268 256) 0))) (or (= (mod ~x$w_buff0_used~0_In938215268 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In938215268 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In938215268 256) 0)))) .cse0 (= ~x$w_buff1_used~0_In938215268 |P0Thread1of1ForFork2_#t~ite17_Out938215268|) (= |P0Thread1of1ForFork2_#t~ite18_Out938215268| |P0Thread1of1ForFork2_#t~ite17_Out938215268|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In938215268, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In938215268|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In938215268, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In938215268, ~weak$$choice2~0=~weak$$choice2~0_In938215268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In938215268} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In938215268, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out938215268|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out938215268|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In938215268, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In938215268, ~weak$$choice2~0=~weak$$choice2~0_In938215268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In938215268} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 10:49:50,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_15|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} 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 10:49:50,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1116821119 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1116821119 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1116821119 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In1116821119 256)) .cse0) (= (mod ~x$w_buff0_used~0_In1116821119 256) 0))) (= ~x$r_buff1_thd1~0_In1116821119 |P0Thread1of1ForFork2_#t~ite23_Out1116821119|) .cse1 (= |P0Thread1of1ForFork2_#t~ite23_Out1116821119| |P0Thread1of1ForFork2_#t~ite24_Out1116821119|)) (and (not .cse1) (= ~x$r_buff1_thd1~0_In1116821119 |P0Thread1of1ForFork2_#t~ite24_Out1116821119|) (= |P0Thread1of1ForFork2_#t~ite23_In1116821119| |P0Thread1of1ForFork2_#t~ite23_Out1116821119|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1116821119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116821119, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1116821119, ~weak$$choice2~0=~weak$$choice2~0_In1116821119, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1116821119|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116821119} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1116821119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116821119, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1116821119, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1116821119|, ~weak$$choice2~0=~weak$$choice2~0_In1116821119, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1116821119|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116821119} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 10:49:50,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In752030197 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In752030197 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In752030197 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In752030197 256) 0))) (or (and (= ~x$w_buff1_used~0_In752030197 |P2Thread1of1ForFork1_#t~ite35_Out752030197|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out752030197|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In752030197, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In752030197, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In752030197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In752030197} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out752030197|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In752030197, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In752030197, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In752030197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In752030197} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 10:49:50,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1169404157 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1169404157 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1169404157| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1169404157| ~x$r_buff0_thd3~0_In1169404157)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1169404157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1169404157} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1169404157|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1169404157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1169404157} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 10:49:50,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In2053228985 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In2053228985 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In2053228985 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2053228985 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out2053228985| ~x$r_buff1_thd3~0_In2053228985) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite37_Out2053228985| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2053228985, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2053228985, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2053228985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2053228985} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out2053228985|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2053228985, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2053228985, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2053228985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2053228985} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:49:50,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, 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 10:49:50,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In866162926 256))) (.cse1 (= ~x$r_buff0_thd2~0_Out866162926 ~x$r_buff0_thd2~0_In866162926)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In866162926 256)))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd2~0_Out866162926 0) (not .cse0) (not .cse2)) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In866162926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In866162926} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out866162926|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out866162926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In866162926} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:49:50,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In146562882 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In146562882 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In146562882 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In146562882 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out146562882| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out146562882| ~x$r_buff1_thd2~0_In146562882) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In146562882, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In146562882, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In146562882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In146562882} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out146562882|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In146562882, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In146562882, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In146562882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In146562882} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:49:50,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_28|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, 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 10:49:50,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 10:49:50,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:49:50,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1809209196 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1809209196 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1809209196 |ULTIMATE.start_main_#t~ite41_Out1809209196|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1809209196| ~x~0_In1809209196)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1809209196, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1809209196, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1809209196, ~x~0=~x~0_In1809209196} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1809209196|, ~x$w_buff1~0=~x$w_buff1~0_In1809209196, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1809209196, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1809209196, ~x~0=~x~0_In1809209196} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 10:49:50,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 10:49:50,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1864577384 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1864577384 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1864577384| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1864577384| ~x$w_buff0_used~0_In1864577384)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1864577384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1864577384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1864577384, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1864577384|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1864577384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:49:50,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In334325240 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In334325240 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In334325240 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In334325240 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out334325240|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In334325240 |ULTIMATE.start_main_#t~ite44_Out334325240|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In334325240, ~x$w_buff1_used~0=~x$w_buff1_used~0_In334325240, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In334325240, ~x$w_buff0_used~0=~x$w_buff0_used~0_In334325240} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In334325240, ~x$w_buff1_used~0=~x$w_buff1_used~0_In334325240, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In334325240, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out334325240|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In334325240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:49:50,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1261580933 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1261580933 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1261580933| ~x$r_buff0_thd0~0_In1261580933)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1261580933|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1261580933, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1261580933} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1261580933, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1261580933|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1261580933} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:49:50,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1137232256 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1137232256 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1137232256 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1137232256 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1137232256|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-1137232256 |ULTIMATE.start_main_#t~ite46_Out-1137232256|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1137232256, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1137232256, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1137232256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1137232256} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1137232256, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1137232256|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1137232256, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1137232256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1137232256} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:49:50,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= 1 v_~__unbuffered_p0_EAX~0_42))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 10:49:50,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:49:50 BasicIcfg [2019-12-07 10:49:50,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:49:50,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:49:50,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:49:50,585 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:49:50,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:48:48" (3/4) ... [2019-12-07 10:49:50,587 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:49:50,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= v_~y~0_203 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25|)) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25| 1)) (= v_~x$mem_tmp~0_35 0) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (= 0 |v_ULTIMATE.start_main_~#t2055~0.offset_19|) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| 4)) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25|) |v_ULTIMATE.start_main_~#t2055~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff1_thd3~0_254) (= v_~main$tmp_guard0~0_48 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2055~0.base_25|) (= 0 v_~x~0_230) (= v_~weak$$choice2~0_176 0) (= v_~x$r_buff0_thd1~0_365 0) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_~#t2055~0.base=|v_ULTIMATE.start_main_~#t2055~0.base_25|, ULTIMATE.start_main_~#t2055~0.offset=|v_ULTIMATE.start_main_~#t2055~0.offset_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_203, ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2056~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2057~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2055~0.base, ULTIMATE.start_main_~#t2055~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2057~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2056~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:49:50,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2056~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= |v_ULTIMATE.start_main_~#t2056~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10|) |v_ULTIMATE.start_main_~#t2056~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2056~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2056~0.base] because there is no mapped edge [2019-12-07 10:49:50,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2057~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11|) |v_ULTIMATE.start_main_~#t2057~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2057~0.base_11| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t2057~0.offset_10| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2057~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2057~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:49:50,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) (not (= (mod v_~x$w_buff0_used~0_105 256) 0)))) 1 0)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 10:49:50,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1630116581 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1630116581 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In1630116581 |P2Thread1of1ForFork1_#t~ite32_Out1630116581|)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out1630116581| ~x$w_buff1~0_In1630116581) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1630116581, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1630116581, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1630116581, ~x~0=~x~0_In1630116581} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1630116581|, ~x$w_buff1~0=~x$w_buff1~0_In1630116581, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1630116581, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1630116581, ~x~0=~x~0_In1630116581} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 10:49:50,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 10:49:50,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In947356831 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In947356831 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out947356831|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In947356831 |P2Thread1of1ForFork1_#t~ite34_Out947356831|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In947356831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In947356831} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out947356831|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In947356831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In947356831} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 10:49:50,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-82572365 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-82572365 256) 0))) (or (and (= ~x$w_buff0_used~0_In-82572365 |P1Thread1of1ForFork0_#t~ite28_Out-82572365|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-82572365|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-82572365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-82572365} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-82572365, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-82572365|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-82572365} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:49:50,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1381200 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1381200 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1381200 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1381200 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1381200 |P1Thread1of1ForFork0_#t~ite29_Out-1381200|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1381200|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1381200, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1381200, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1381200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1381200} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1381200, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1381200, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1381200, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1381200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1381200} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:49:50,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-103038283 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out-103038283| |P0Thread1of1ForFork2_#t~ite9_Out-103038283|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-103038283 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-103038283 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-103038283 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-103038283 256))))) (= |P0Thread1of1ForFork2_#t~ite8_Out-103038283| ~x$w_buff0~0_In-103038283)) (and (= |P0Thread1of1ForFork2_#t~ite8_In-103038283| |P0Thread1of1ForFork2_#t~ite8_Out-103038283|) (= ~x$w_buff0~0_In-103038283 |P0Thread1of1ForFork2_#t~ite9_Out-103038283|) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-103038283, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-103038283, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-103038283|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-103038283, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-103038283, ~weak$$choice2~0=~weak$$choice2~0_In-103038283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-103038283} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-103038283, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-103038283, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-103038283|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-103038283, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-103038283|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-103038283, ~weak$$choice2~0=~weak$$choice2~0_In-103038283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-103038283} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 10:49:50,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1242636421 256)))) (or (and (= ~x$w_buff0_used~0_In-1242636421 |P0Thread1of1ForFork2_#t~ite15_Out-1242636421|) (= |P0Thread1of1ForFork2_#t~ite14_In-1242636421| |P0Thread1of1ForFork2_#t~ite14_Out-1242636421|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out-1242636421| |P0Thread1of1ForFork2_#t~ite14_Out-1242636421|) (= ~x$w_buff0_used~0_In-1242636421 |P0Thread1of1ForFork2_#t~ite14_Out-1242636421|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1242636421 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-1242636421 256) 0)) (= (mod ~x$w_buff0_used~0_In-1242636421 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1242636421 256))))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1242636421, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1242636421, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1242636421, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1242636421|, ~weak$$choice2~0=~weak$$choice2~0_In-1242636421, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1242636421} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1242636421, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1242636421, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1242636421|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1242636421, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1242636421|, ~weak$$choice2~0=~weak$$choice2~0_In-1242636421, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1242636421} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 10:49:50,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In938215268 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In938215268| |P0Thread1of1ForFork2_#t~ite17_Out938215268|) (= ~x$w_buff1_used~0_In938215268 |P0Thread1of1ForFork2_#t~ite18_Out938215268|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In938215268 256) 0))) (or (= (mod ~x$w_buff0_used~0_In938215268 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In938215268 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In938215268 256) 0)))) .cse0 (= ~x$w_buff1_used~0_In938215268 |P0Thread1of1ForFork2_#t~ite17_Out938215268|) (= |P0Thread1of1ForFork2_#t~ite18_Out938215268| |P0Thread1of1ForFork2_#t~ite17_Out938215268|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In938215268, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In938215268|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In938215268, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In938215268, ~weak$$choice2~0=~weak$$choice2~0_In938215268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In938215268} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In938215268, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out938215268|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out938215268|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In938215268, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In938215268, ~weak$$choice2~0=~weak$$choice2~0_In938215268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In938215268} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 10:49:50,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_15|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} 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 10:49:50,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1116821119 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1116821119 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1116821119 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In1116821119 256)) .cse0) (= (mod ~x$w_buff0_used~0_In1116821119 256) 0))) (= ~x$r_buff1_thd1~0_In1116821119 |P0Thread1of1ForFork2_#t~ite23_Out1116821119|) .cse1 (= |P0Thread1of1ForFork2_#t~ite23_Out1116821119| |P0Thread1of1ForFork2_#t~ite24_Out1116821119|)) (and (not .cse1) (= ~x$r_buff1_thd1~0_In1116821119 |P0Thread1of1ForFork2_#t~ite24_Out1116821119|) (= |P0Thread1of1ForFork2_#t~ite23_In1116821119| |P0Thread1of1ForFork2_#t~ite23_Out1116821119|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1116821119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116821119, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1116821119, ~weak$$choice2~0=~weak$$choice2~0_In1116821119, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1116821119|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116821119} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1116821119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116821119, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1116821119, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1116821119|, ~weak$$choice2~0=~weak$$choice2~0_In1116821119, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1116821119|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116821119} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 10:49:50,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In752030197 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In752030197 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In752030197 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In752030197 256) 0))) (or (and (= ~x$w_buff1_used~0_In752030197 |P2Thread1of1ForFork1_#t~ite35_Out752030197|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out752030197|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In752030197, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In752030197, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In752030197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In752030197} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out752030197|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In752030197, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In752030197, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In752030197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In752030197} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 10:49:50,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1169404157 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1169404157 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1169404157| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1169404157| ~x$r_buff0_thd3~0_In1169404157)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1169404157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1169404157} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1169404157|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1169404157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1169404157} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 10:49:50,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In2053228985 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In2053228985 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In2053228985 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2053228985 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out2053228985| ~x$r_buff1_thd3~0_In2053228985) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite37_Out2053228985| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2053228985, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2053228985, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2053228985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2053228985} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out2053228985|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2053228985, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2053228985, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2053228985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2053228985} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:49:50,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, 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 10:49:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In866162926 256))) (.cse1 (= ~x$r_buff0_thd2~0_Out866162926 ~x$r_buff0_thd2~0_In866162926)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In866162926 256)))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd2~0_Out866162926 0) (not .cse0) (not .cse2)) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In866162926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In866162926} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out866162926|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out866162926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In866162926} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:49:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In146562882 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In146562882 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In146562882 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In146562882 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out146562882| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out146562882| ~x$r_buff1_thd2~0_In146562882) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In146562882, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In146562882, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In146562882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In146562882} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out146562882|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In146562882, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In146562882, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In146562882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In146562882} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:49:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_28|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, 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 10:49:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 10:49:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:49:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1809209196 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1809209196 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1809209196 |ULTIMATE.start_main_#t~ite41_Out1809209196|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1809209196| ~x~0_In1809209196)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1809209196, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1809209196, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1809209196, ~x~0=~x~0_In1809209196} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1809209196|, ~x$w_buff1~0=~x$w_buff1~0_In1809209196, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1809209196, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1809209196, ~x~0=~x~0_In1809209196} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 10:49:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 10:49:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1864577384 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1864577384 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1864577384| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1864577384| ~x$w_buff0_used~0_In1864577384)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1864577384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1864577384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1864577384, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1864577384|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1864577384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:49:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In334325240 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In334325240 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In334325240 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In334325240 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out334325240|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In334325240 |ULTIMATE.start_main_#t~ite44_Out334325240|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In334325240, ~x$w_buff1_used~0=~x$w_buff1_used~0_In334325240, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In334325240, ~x$w_buff0_used~0=~x$w_buff0_used~0_In334325240} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In334325240, ~x$w_buff1_used~0=~x$w_buff1_used~0_In334325240, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In334325240, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out334325240|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In334325240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:49:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1261580933 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1261580933 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1261580933| ~x$r_buff0_thd0~0_In1261580933)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1261580933|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1261580933, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1261580933} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1261580933, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1261580933|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1261580933} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:49:50,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1137232256 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1137232256 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1137232256 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1137232256 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1137232256|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-1137232256 |ULTIMATE.start_main_#t~ite46_Out-1137232256|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1137232256, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1137232256, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1137232256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1137232256} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1137232256, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1137232256|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1137232256, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1137232256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1137232256} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:49:50,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= 1 v_~__unbuffered_p0_EAX~0_42))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 10:49:50,647 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_33957fd1-8edd-4bdc-82e0-28d78f102912/bin/uautomizer/witness.graphml [2019-12-07 10:49:50,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:49:50,648 INFO L168 Benchmark]: Toolchain (without parser) took 63207.74 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 935.3 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 10:49:50,648 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:49:50,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:50,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:50,649 INFO L168 Benchmark]: Boogie Preprocessor took 24.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:50,649 INFO L168 Benchmark]: RCFGBuilder took 392.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:50,650 INFO L168 Benchmark]: TraceAbstraction took 62322.04 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 10:49:50,650 INFO L168 Benchmark]: Witness Printer took 61.54 ms. Allocated memory is still 6.4 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:50,651 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 392.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62322.04 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 61.54 ms. Allocated memory is still 6.4 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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] [L820] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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=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] [L775] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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=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] [L822] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1, z=1] [L795] 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, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1, z=1] [L775] 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) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 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 [L739] 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) [L740] 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)) [L741] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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 : (!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))=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=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 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)) [L742] 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)) [L743] 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)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 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)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 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 [L831] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 62.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2659 SDtfs, 3840 SDslu, 8306 SDs, 0 SdLazy, 3526 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134187occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 104448 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 503 ConstructedInterpolants, 0 QuantifiedInterpolants, 91689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...