./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/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 8407640384d9c62c9303a97bf3c167a9bd85dcbe .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:53:36,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:53:36,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:53:36,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:53:36,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:53:36,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:53:36,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:53:36,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:53:36,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:53:36,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:53:36,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:53:36,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:53:36,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:53:36,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:53:36,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:53:36,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:53:36,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:53:36,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:53:36,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:53:36,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:53:36,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:53:36,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:53:36,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:53:36,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:53:36,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:53:36,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:53:36,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:53:36,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:53:36,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:53:36,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:53:36,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:53:36,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:53:36,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:53:36,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:53:36,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:53:36,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:53:36,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:53:37,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:53:37,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:53:37,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:53:37,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:53:37,001 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:53:37,010 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:53:37,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:53:37,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:53:37,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:53:37,012 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:53:37,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:53:37,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:53:37,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:53:37,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:53:37,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:53:37,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:53:37,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:53:37,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:53:37,013 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:53:37,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:53:37,013 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:53:37,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:53:37,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:53:37,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:53:37,014 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:53:37,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:53:37,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:53:37,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:53:37,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:53:37,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:53:37,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:53:37,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:53:37,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:53:37,015 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:53:37,015 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_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/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 -> 8407640384d9c62c9303a97bf3c167a9bd85dcbe [2019-12-07 13:53:37,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:53:37,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:53:37,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:53:37,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:53:37,126 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:53:37,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i [2019-12-07 13:53:37,171 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/data/60ec17d08/e44ecc1d764f4e07aa76fd34afa103a1/FLAGae15f10e8 [2019-12-07 13:53:37,538 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:53:37,538 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i [2019-12-07 13:53:37,549 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/data/60ec17d08/e44ecc1d764f4e07aa76fd34afa103a1/FLAGae15f10e8 [2019-12-07 13:53:37,558 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/data/60ec17d08/e44ecc1d764f4e07aa76fd34afa103a1 [2019-12-07 13:53:37,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:53:37,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:53:37,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:53:37,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:53:37,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:53:37,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:37,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37, skipping insertion in model container [2019-12-07 13:53:37,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:37,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:53:37,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:53:37,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:53:37,863 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:53:37,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:53:37,950 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:53:37,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37 WrapperNode [2019-12-07 13:53:37,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:53:37,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:53:37,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:53:37,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:53:37,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:37,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:37,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:53:37,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:53:37,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:53:37,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:53:37,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:37,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:37,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:37,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:38,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:38,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:38,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... [2019-12-07 13:53:38,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:53:38,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:53:38,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:53:38,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:53:38,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:53:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:53:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:53:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:53:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:53:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:53:38,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:53:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:53:38,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:53:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:53:38,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:53:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:53:38,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:53:38,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:53:38,053 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:53:38,380 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:53:38,380 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:53:38,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:53:38 BoogieIcfgContainer [2019-12-07 13:53:38,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:53:38,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:53:38,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:53:38,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:53:38,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:53:37" (1/3) ... [2019-12-07 13:53:38,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e364ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:53:38, skipping insertion in model container [2019-12-07 13:53:38,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:37" (2/3) ... [2019-12-07 13:53:38,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e364ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:53:38, skipping insertion in model container [2019-12-07 13:53:38,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:53:38" (3/3) ... [2019-12-07 13:53:38,386 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt.i [2019-12-07 13:53:38,392 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:53:38,392 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:53:38,397 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:53:38,397 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:53:38,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,420 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,420 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,421 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,421 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,432 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,432 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,432 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,432 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,433 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:53:38,446 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:53:38,459 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:53:38,459 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:53:38,459 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:53:38,459 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:53:38,459 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:53:38,459 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:53:38,459 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:53:38,459 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:53:38,469 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 179 transitions [2019-12-07 13:53:38,470 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-07 13:53:38,519 INFO L134 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-07 13:53:38,519 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:53:38,527 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 13:53:38,539 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-07 13:53:38,564 INFO L134 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-07 13:53:38,564 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:53:38,568 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 13:53:38,577 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 13:53:38,578 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:53:41,398 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 13:53:41,493 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44280 [2019-12-07 13:53:41,493 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 13:53:41,495 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 79 transitions [2019-12-07 13:53:42,008 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12302 states. [2019-12-07 13:53:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 12302 states. [2019-12-07 13:53:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:53:42,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:42,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:42,014 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash -941376449, now seen corresponding path program 1 times [2019-12-07 13:53:42,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:42,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038866348] [2019-12-07 13:53:42,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:42,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038866348] [2019-12-07 13:53:42,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:42,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:53:42,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647789694] [2019-12-07 13:53:42,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:53:42,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:42,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:53:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:42,191 INFO L87 Difference]: Start difference. First operand 12302 states. Second operand 3 states. [2019-12-07 13:53:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:42,382 INFO L93 Difference]: Finished difference Result 11966 states and 45788 transitions. [2019-12-07 13:53:42,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:53:42,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 13:53:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:42,480 INFO L225 Difference]: With dead ends: 11966 [2019-12-07 13:53:42,480 INFO L226 Difference]: Without dead ends: 11270 [2019-12-07 13:53:42,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2019-12-07 13:53:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11270. [2019-12-07 13:53:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-12-07 13:53:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 43054 transitions. [2019-12-07 13:53:42,919 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 43054 transitions. Word has length 7 [2019-12-07 13:53:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:42,920 INFO L462 AbstractCegarLoop]: Abstraction has 11270 states and 43054 transitions. [2019-12-07 13:53:42,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:53:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 43054 transitions. [2019-12-07 13:53:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:53:42,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:42,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:42,925 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash -941453907, now seen corresponding path program 1 times [2019-12-07 13:53:42,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:42,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107538073] [2019-12-07 13:53:42,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:42,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107538073] [2019-12-07 13:53:42,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:42,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:53:42,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605374943] [2019-12-07 13:53:42,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:42,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:42,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:42,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:42,986 INFO L87 Difference]: Start difference. First operand 11270 states and 43054 transitions. Second operand 4 states. [2019-12-07 13:53:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:43,279 INFO L93 Difference]: Finished difference Result 16970 states and 62500 transitions. [2019-12-07 13:53:43,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:53:43,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:53:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:43,352 INFO L225 Difference]: With dead ends: 16970 [2019-12-07 13:53:43,352 INFO L226 Difference]: Without dead ends: 16944 [2019-12-07 13:53:43,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16944 states. [2019-12-07 13:53:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16944 to 15456. [2019-12-07 13:53:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15456 states. [2019-12-07 13:53:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15456 states to 15456 states and 57661 transitions. [2019-12-07 13:53:43,786 INFO L78 Accepts]: Start accepts. Automaton has 15456 states and 57661 transitions. Word has length 13 [2019-12-07 13:53:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:43,787 INFO L462 AbstractCegarLoop]: Abstraction has 15456 states and 57661 transitions. [2019-12-07 13:53:43,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 15456 states and 57661 transitions. [2019-12-07 13:53:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:53:43,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:43,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:43,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash 166730424, now seen corresponding path program 1 times [2019-12-07 13:53:43,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:43,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660748735] [2019-12-07 13:53:43,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:43,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660748735] [2019-12-07 13:53:43,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:43,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:53:43,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759948164] [2019-12-07 13:53:43,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:53:43,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:53:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:43,834 INFO L87 Difference]: Start difference. First operand 15456 states and 57661 transitions. Second operand 3 states. [2019-12-07 13:53:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:43,919 INFO L93 Difference]: Finished difference Result 20134 states and 73756 transitions. [2019-12-07 13:53:43,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:53:43,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:53:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:43,972 INFO L225 Difference]: With dead ends: 20134 [2019-12-07 13:53:43,972 INFO L226 Difference]: Without dead ends: 20134 [2019-12-07 13:53:43,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20134 states. [2019-12-07 13:53:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20134 to 16742. [2019-12-07 13:53:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16742 states. [2019-12-07 13:53:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 62266 transitions. [2019-12-07 13:53:44,386 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 62266 transitions. Word has length 16 [2019-12-07 13:53:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:44,386 INFO L462 AbstractCegarLoop]: Abstraction has 16742 states and 62266 transitions. [2019-12-07 13:53:44,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:53:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 62266 transitions. [2019-12-07 13:53:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:53:44,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:44,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:44,389 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash 166596039, now seen corresponding path program 1 times [2019-12-07 13:53:44,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:44,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716774232] [2019-12-07 13:53:44,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:44,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716774232] [2019-12-07 13:53:44,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:44,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:53:44,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101184893] [2019-12-07 13:53:44,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:44,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:44,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:44,441 INFO L87 Difference]: Start difference. First operand 16742 states and 62266 transitions. Second operand 4 states. [2019-12-07 13:53:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:44,591 INFO L93 Difference]: Finished difference Result 20458 states and 74724 transitions. [2019-12-07 13:53:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:53:44,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:53:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:44,623 INFO L225 Difference]: With dead ends: 20458 [2019-12-07 13:53:44,624 INFO L226 Difference]: Without dead ends: 20438 [2019-12-07 13:53:44,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20438 states. [2019-12-07 13:53:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20438 to 17660. [2019-12-07 13:53:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17660 states. [2019-12-07 13:53:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17660 states to 17660 states and 65445 transitions. [2019-12-07 13:53:44,948 INFO L78 Accepts]: Start accepts. Automaton has 17660 states and 65445 transitions. Word has length 16 [2019-12-07 13:53:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:44,948 INFO L462 AbstractCegarLoop]: Abstraction has 17660 states and 65445 transitions. [2019-12-07 13:53:44,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 17660 states and 65445 transitions. [2019-12-07 13:53:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:53:44,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:44,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:44,951 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:44,951 INFO L82 PathProgramCache]: Analyzing trace with hash 289916209, now seen corresponding path program 1 times [2019-12-07 13:53:44,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:44,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391790057] [2019-12-07 13:53:44,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:44,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391790057] [2019-12-07 13:53:44,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:44,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:53:44,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939563843] [2019-12-07 13:53:44,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:44,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:44,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:44,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:44,988 INFO L87 Difference]: Start difference. First operand 17660 states and 65445 transitions. Second operand 4 states. [2019-12-07 13:53:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:45,161 INFO L93 Difference]: Finished difference Result 22396 states and 81911 transitions. [2019-12-07 13:53:45,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:53:45,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:53:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:45,201 INFO L225 Difference]: With dead ends: 22396 [2019-12-07 13:53:45,202 INFO L226 Difference]: Without dead ends: 22368 [2019-12-07 13:53:45,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22368 states. [2019-12-07 13:53:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22368 to 18470. [2019-12-07 13:53:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18470 states. [2019-12-07 13:53:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18470 states to 18470 states and 68496 transitions. [2019-12-07 13:53:45,582 INFO L78 Accepts]: Start accepts. Automaton has 18470 states and 68496 transitions. Word has length 16 [2019-12-07 13:53:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:45,582 INFO L462 AbstractCegarLoop]: Abstraction has 18470 states and 68496 transitions. [2019-12-07 13:53:45,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 18470 states and 68496 transitions. [2019-12-07 13:53:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:53:45,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:45,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:45,588 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1946092179, now seen corresponding path program 1 times [2019-12-07 13:53:45,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:45,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405490947] [2019-12-07 13:53:45,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:45,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405490947] [2019-12-07 13:53:45,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:45,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:53:45,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744029704] [2019-12-07 13:53:45,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:53:45,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:45,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:53:45,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:45,641 INFO L87 Difference]: Start difference. First operand 18470 states and 68496 transitions. Second operand 3 states. [2019-12-07 13:53:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:45,705 INFO L93 Difference]: Finished difference Result 18412 states and 68120 transitions. [2019-12-07 13:53:45,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:53:45,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:53:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:45,734 INFO L225 Difference]: With dead ends: 18412 [2019-12-07 13:53:45,734 INFO L226 Difference]: Without dead ends: 18412 [2019-12-07 13:53:45,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18412 states. [2019-12-07 13:53:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18412 to 18360. [2019-12-07 13:53:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18360 states. [2019-12-07 13:53:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18360 states to 18360 states and 68030 transitions. [2019-12-07 13:53:46,094 INFO L78 Accepts]: Start accepts. Automaton has 18360 states and 68030 transitions. Word has length 18 [2019-12-07 13:53:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:46,094 INFO L462 AbstractCegarLoop]: Abstraction has 18360 states and 68030 transitions. [2019-12-07 13:53:46,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:53:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 18360 states and 68030 transitions. [2019-12-07 13:53:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:53:46,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:46,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:46,100 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:46,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:46,100 INFO L82 PathProgramCache]: Analyzing trace with hash 631217210, now seen corresponding path program 1 times [2019-12-07 13:53:46,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:46,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710552516] [2019-12-07 13:53:46,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710552516] [2019-12-07 13:53:46,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:46,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:53:46,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96668105] [2019-12-07 13:53:46,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:46,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:46,130 INFO L87 Difference]: Start difference. First operand 18360 states and 68030 transitions. Second operand 4 states. [2019-12-07 13:53:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:46,147 INFO L93 Difference]: Finished difference Result 2242 states and 5899 transitions. [2019-12-07 13:53:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:53:46,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 13:53:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:46,150 INFO L225 Difference]: With dead ends: 2242 [2019-12-07 13:53:46,150 INFO L226 Difference]: Without dead ends: 2242 [2019-12-07 13:53:46,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-12-07 13:53:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2019-12-07 13:53:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2019-12-07 13:53:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 5899 transitions. [2019-12-07 13:53:46,171 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 5899 transitions. Word has length 19 [2019-12-07 13:53:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:46,171 INFO L462 AbstractCegarLoop]: Abstraction has 2242 states and 5899 transitions. [2019-12-07 13:53:46,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 5899 transitions. [2019-12-07 13:53:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:53:46,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:46,173 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] [2019-12-07 13:53:46,173 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash -45017831, now seen corresponding path program 1 times [2019-12-07 13:53:46,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:46,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686677895] [2019-12-07 13:53:46,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686677895] [2019-12-07 13:53:46,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:46,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:53:46,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49413366] [2019-12-07 13:53:46,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:53:46,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:46,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:53:46,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:46,219 INFO L87 Difference]: Start difference. First operand 2242 states and 5899 transitions. Second operand 5 states. [2019-12-07 13:53:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:46,329 INFO L93 Difference]: Finished difference Result 2957 states and 7598 transitions. [2019-12-07 13:53:46,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:53:46,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 13:53:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:46,332 INFO L225 Difference]: With dead ends: 2957 [2019-12-07 13:53:46,332 INFO L226 Difference]: Without dead ends: 2955 [2019-12-07 13:53:46,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:53:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2019-12-07 13:53:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2398. [2019-12-07 13:53:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2019-12-07 13:53:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 6291 transitions. [2019-12-07 13:53:46,356 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 6291 transitions. Word has length 29 [2019-12-07 13:53:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:46,356 INFO L462 AbstractCegarLoop]: Abstraction has 2398 states and 6291 transitions. [2019-12-07 13:53:46,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:53:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 6291 transitions. [2019-12-07 13:53:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:53:46,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:46,359 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] [2019-12-07 13:53:46,359 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:46,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 856751491, now seen corresponding path program 1 times [2019-12-07 13:53:46,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:46,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973131333] [2019-12-07 13:53:46,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973131333] [2019-12-07 13:53:46,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:46,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:53:46,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614941527] [2019-12-07 13:53:46,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:53:46,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:46,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:53:46,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:46,381 INFO L87 Difference]: Start difference. First operand 2398 states and 6291 transitions. Second operand 3 states. [2019-12-07 13:53:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:46,416 INFO L93 Difference]: Finished difference Result 3071 states and 7827 transitions. [2019-12-07 13:53:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:53:46,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 13:53:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:46,420 INFO L225 Difference]: With dead ends: 3071 [2019-12-07 13:53:46,420 INFO L226 Difference]: Without dead ends: 3071 [2019-12-07 13:53:46,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2019-12-07 13:53:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 2442. [2019-12-07 13:53:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2019-12-07 13:53:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 6224 transitions. [2019-12-07 13:53:46,457 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 6224 transitions. Word has length 29 [2019-12-07 13:53:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:46,457 INFO L462 AbstractCegarLoop]: Abstraction has 2442 states and 6224 transitions. [2019-12-07 13:53:46,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:53:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 6224 transitions. [2019-12-07 13:53:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:53:46,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:46,461 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] [2019-12-07 13:53:46,461 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:46,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1339717978, now seen corresponding path program 1 times [2019-12-07 13:53:46,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:46,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578513388] [2019-12-07 13:53:46,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578513388] [2019-12-07 13:53:46,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:46,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:53:46,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597931554] [2019-12-07 13:53:46,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:53:46,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:46,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:53:46,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:46,515 INFO L87 Difference]: Start difference. First operand 2442 states and 6224 transitions. Second operand 5 states. [2019-12-07 13:53:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:46,758 INFO L93 Difference]: Finished difference Result 3611 states and 9082 transitions. [2019-12-07 13:53:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:53:46,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 13:53:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:46,761 INFO L225 Difference]: With dead ends: 3611 [2019-12-07 13:53:46,761 INFO L226 Difference]: Without dead ends: 3611 [2019-12-07 13:53:46,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:53:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2019-12-07 13:53:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3059. [2019-12-07 13:53:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2019-12-07 13:53:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 7781 transitions. [2019-12-07 13:53:46,789 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 7781 transitions. Word has length 29 [2019-12-07 13:53:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:46,789 INFO L462 AbstractCegarLoop]: Abstraction has 3059 states and 7781 transitions. [2019-12-07 13:53:46,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:53:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 7781 transitions. [2019-12-07 13:53:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:53:46,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:46,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:46,792 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:46,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash -85244973, now seen corresponding path program 1 times [2019-12-07 13:53:46,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:46,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834856989] [2019-12-07 13:53:46,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834856989] [2019-12-07 13:53:46,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:46,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:53:46,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723637063] [2019-12-07 13:53:46,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:53:46,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:46,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:53:46,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:46,844 INFO L87 Difference]: Start difference. First operand 3059 states and 7781 transitions. Second operand 5 states. [2019-12-07 13:53:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:46,968 INFO L93 Difference]: Finished difference Result 3649 states and 9164 transitions. [2019-12-07 13:53:46,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:53:46,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 13:53:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:46,971 INFO L225 Difference]: With dead ends: 3649 [2019-12-07 13:53:46,972 INFO L226 Difference]: Without dead ends: 3647 [2019-12-07 13:53:46,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:53:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3647 states. [2019-12-07 13:53:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3647 to 3014. [2019-12-07 13:53:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3014 states. [2019-12-07 13:53:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 7655 transitions. [2019-12-07 13:53:47,002 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 7655 transitions. Word has length 30 [2019-12-07 13:53:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:47,002 INFO L462 AbstractCegarLoop]: Abstraction has 3014 states and 7655 transitions. [2019-12-07 13:53:47,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:53:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 7655 transitions. [2019-12-07 13:53:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:53:47,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:47,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:47,005 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1272719188, now seen corresponding path program 1 times [2019-12-07 13:53:47,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:47,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965443384] [2019-12-07 13:53:47,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965443384] [2019-12-07 13:53:47,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:47,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:53:47,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865319806] [2019-12-07 13:53:47,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:53:47,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:53:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:47,047 INFO L87 Difference]: Start difference. First operand 3014 states and 7655 transitions. Second operand 5 states. [2019-12-07 13:53:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:47,071 INFO L93 Difference]: Finished difference Result 1988 states and 5115 transitions. [2019-12-07 13:53:47,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:53:47,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 13:53:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:47,073 INFO L225 Difference]: With dead ends: 1988 [2019-12-07 13:53:47,073 INFO L226 Difference]: Without dead ends: 1988 [2019-12-07 13:53:47,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-12-07 13:53:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1752. [2019-12-07 13:53:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-07 13:53:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4549 transitions. [2019-12-07 13:53:47,089 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4549 transitions. Word has length 30 [2019-12-07 13:53:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:47,089 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4549 transitions. [2019-12-07 13:53:47,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:53:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4549 transitions. [2019-12-07 13:53:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 13:53:47,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:47,091 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] [2019-12-07 13:53:47,091 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:47,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash -651252201, now seen corresponding path program 1 times [2019-12-07 13:53:47,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:47,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128597252] [2019-12-07 13:53:47,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128597252] [2019-12-07 13:53:47,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:47,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:53:47,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645161574] [2019-12-07 13:53:47,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:53:47,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:47,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:53:47,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:47,148 INFO L87 Difference]: Start difference. First operand 1752 states and 4549 transitions. Second operand 3 states. [2019-12-07 13:53:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:47,158 INFO L93 Difference]: Finished difference Result 1750 states and 4544 transitions. [2019-12-07 13:53:47,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:53:47,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 13:53:47,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:47,160 INFO L225 Difference]: With dead ends: 1750 [2019-12-07 13:53:47,160 INFO L226 Difference]: Without dead ends: 1750 [2019-12-07 13:53:47,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-12-07 13:53:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1524. [2019-12-07 13:53:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2019-12-07 13:53:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 4001 transitions. [2019-12-07 13:53:47,174 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 4001 transitions. Word has length 44 [2019-12-07 13:53:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:47,174 INFO L462 AbstractCegarLoop]: Abstraction has 1524 states and 4001 transitions. [2019-12-07 13:53:47,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:53:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 4001 transitions. [2019-12-07 13:53:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:53:47,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:47,176 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] [2019-12-07 13:53:47,176 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:47,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1405116581, now seen corresponding path program 1 times [2019-12-07 13:53:47,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:47,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079568551] [2019-12-07 13:53:47,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079568551] [2019-12-07 13:53:47,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:47,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:53:47,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022271378] [2019-12-07 13:53:47,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:53:47,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:53:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:53:47,312 INFO L87 Difference]: Start difference. First operand 1524 states and 4001 transitions. Second operand 9 states. [2019-12-07 13:53:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:47,639 INFO L93 Difference]: Finished difference Result 2517 states and 6116 transitions. [2019-12-07 13:53:47,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:53:47,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-12-07 13:53:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:47,641 INFO L225 Difference]: With dead ends: 2517 [2019-12-07 13:53:47,641 INFO L226 Difference]: Without dead ends: 801 [2019-12-07 13:53:47,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:53:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-12-07 13:53:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2019-12-07 13:53:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-12-07 13:53:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1696 transitions. [2019-12-07 13:53:47,650 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1696 transitions. Word has length 45 [2019-12-07 13:53:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:47,651 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1696 transitions. [2019-12-07 13:53:47,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:53:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1696 transitions. [2019-12-07 13:53:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:53:47,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:47,652 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] [2019-12-07 13:53:47,652 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1055766469, now seen corresponding path program 2 times [2019-12-07 13:53:47,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:47,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356549751] [2019-12-07 13:53:47,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356549751] [2019-12-07 13:53:47,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:47,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:53:47,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296573407] [2019-12-07 13:53:47,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:53:47,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:53:47,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:53:47,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:47,717 INFO L87 Difference]: Start difference. First operand 801 states and 1696 transitions. Second operand 5 states. [2019-12-07 13:53:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:47,736 INFO L93 Difference]: Finished difference Result 1388 states and 2958 transitions. [2019-12-07 13:53:47,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:53:47,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-07 13:53:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:47,737 INFO L225 Difference]: With dead ends: 1388 [2019-12-07 13:53:47,737 INFO L226 Difference]: Without dead ends: 617 [2019-12-07 13:53:47,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:53:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-12-07 13:53:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-12-07 13:53:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-12-07 13:53:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1312 transitions. [2019-12-07 13:53:47,744 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1312 transitions. Word has length 45 [2019-12-07 13:53:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:47,744 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 1312 transitions. [2019-12-07 13:53:47,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:53:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1312 transitions. [2019-12-07 13:53:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:53:47,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:47,745 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] [2019-12-07 13:53:47,745 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:47,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:47,746 INFO L82 PathProgramCache]: Analyzing trace with hash -252375621, now seen corresponding path program 3 times [2019-12-07 13:53:47,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:53:47,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530972516] [2019-12-07 13:53:47,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:53:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:53:47,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:53:47,806 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:53:47,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t922~0.base_38| 4)) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= 0 |v_ULTIMATE.start_main_~#t922~0.offset_26|) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) |v_ULTIMATE.start_main_~#t922~0.offset_26| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38| 1)) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38|)) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_32|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ULTIMATE.start_main_~#t922~0.offset=|v_ULTIMATE.start_main_~#t922~0.offset_26|, ~y~0=v_~y~0_134, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_19|, ULTIMATE.start_main_~#t922~0.base=|v_ULTIMATE.start_main_~#t922~0.base_38|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t924~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t922~0.offset, ~y~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t923~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t923~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, ULTIMATE.start_main_~#t922~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:53:47,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) |v_ULTIMATE.start_main_~#t923~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t923~0.base_13| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t923~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t923~0.offset_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t923~0.offset, #length, ULTIMATE.start_main_~#t923~0.base] because there is no mapped edge [2019-12-07 13:53:47,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (not (= |v_ULTIMATE.start_main_~#t924~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t924~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t924~0.base_12| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) |v_ULTIMATE.start_main_~#t924~0.offset_10| 2))) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t924~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, #length] because there is no mapped edge [2019-12-07 13:53:47,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:53:47,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:53:47,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1870221026 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1870221026| |P1Thread1of1ForFork1_#t~ite8_Out-1870221026|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1870221026 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1870221026 256)) (and (= (mod ~y$w_buff1_used~0_In-1870221026 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In-1870221026 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite8_Out-1870221026| ~y$w_buff0~0_In-1870221026)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite8_In-1870221026| |P1Thread1of1ForFork1_#t~ite8_Out-1870221026|) (= |P1Thread1of1ForFork1_#t~ite9_Out-1870221026| ~y$w_buff0~0_In-1870221026)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1870221026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1870221026, ~y$w_buff0~0=~y$w_buff0~0_In-1870221026, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1870221026, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-1870221026|, ~weak$$choice2~0=~weak$$choice2~0_In-1870221026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1870221026} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1870221026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1870221026, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1870221026|, ~y$w_buff0~0=~y$w_buff0~0_In-1870221026, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1870221026, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-1870221026|, ~weak$$choice2~0=~weak$$choice2~0_In-1870221026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1870221026} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:53:47,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:53:47,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1997920202 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-1997920202| |P1Thread1of1ForFork1_#t~ite23_Out-1997920202|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-1997920202| ~y$r_buff1_thd2~0_In-1997920202)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1997920202| ~y$r_buff1_thd2~0_In-1997920202) (= |P1Thread1of1ForFork1_#t~ite24_Out-1997920202| |P1Thread1of1ForFork1_#t~ite23_Out-1997920202|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1997920202 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1997920202 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1997920202 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1997920202 256) 0)))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1997920202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997920202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1997920202|, ~weak$$choice2~0=~weak$$choice2~0_In-1997920202, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1997920202} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1997920202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997920202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1997920202|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1997920202|, ~weak$$choice2~0=~weak$$choice2~0_In-1997920202, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1997920202} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 13:53:47,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:53:47,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1138932279 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1138932279 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out1138932279| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1138932279 |P2Thread1of1ForFork2_#t~ite28_Out1138932279|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1138932279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1138932279} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1138932279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1138932279, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1138932279|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:53:47,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-10693696 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-10693696 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-10693696 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-10693696 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out-10693696| ~y$w_buff1_used~0_In-10693696)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-10693696|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-10693696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-10693696, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-10693696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-10693696} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-10693696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-10693696, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-10693696, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-10693696|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-10693696} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:53:47,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In987979922 256))) (.cse0 (= ~y$r_buff0_thd3~0_In987979922 ~y$r_buff0_thd3~0_Out987979922)) (.cse2 (= (mod ~y$w_buff0_used~0_In987979922 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out987979922)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In987979922, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In987979922} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In987979922, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out987979922|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out987979922} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 13:53:47,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-81080734 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-81080734 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-81080734 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-81080734 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-81080734|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd3~0_In-81080734 |P2Thread1of1ForFork2_#t~ite31_Out-81080734|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-81080734, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-81080734, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-81080734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81080734} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-81080734, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-81080734, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-81080734|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-81080734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81080734} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:53:47,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:53:47,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:53:47,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1011290037 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1011290037 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out1011290037| ~y~0_In1011290037) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out1011290037| ~y$w_buff1~0_In1011290037) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y~0=~y~0_In1011290037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1011290037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1011290037, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1011290037|, ~y~0=~y~0_In1011290037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1011290037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 13:53:47,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 13:53:47,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-46855129 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-46855129 256) 0))) (or (and (= ~y$w_buff0_used~0_In-46855129 |ULTIMATE.start_main_#t~ite37_Out-46855129|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-46855129|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-46855129} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-46855129, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-46855129|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:53:47,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1699082295 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1699082295 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1699082295 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1699082295 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out-1699082295| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1699082295| ~y$w_buff1_used~0_In-1699082295) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699082295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1699082295, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1699082295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699082295} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699082295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1699082295, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1699082295|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1699082295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699082295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:53:47,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1171918978 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1171918978 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1171918978| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1171918978| ~y$r_buff0_thd0~0_In1171918978)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1171918978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1171918978} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1171918978, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1171918978|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1171918978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:53:47,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In2121659578 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2121659578 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2121659578 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2121659578 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2121659578| ~y$r_buff1_thd0~0_In2121659578) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite40_Out2121659578|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2121659578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2121659578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2121659578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121659578} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2121659578|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121659578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2121659578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2121659578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121659578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:53:47,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_84 0) (= 1 v_~__unbuffered_p2_EAX~0_84) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:53:47,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:53:47 BasicIcfg [2019-12-07 13:53:47,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:53:47,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:53:47,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:53:47,863 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:53:47,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:53:38" (3/4) ... [2019-12-07 13:53:47,865 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:53:47,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t922~0.base_38| 4)) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= 0 |v_ULTIMATE.start_main_~#t922~0.offset_26|) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) |v_ULTIMATE.start_main_~#t922~0.offset_26| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38| 1)) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38|)) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_32|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ULTIMATE.start_main_~#t922~0.offset=|v_ULTIMATE.start_main_~#t922~0.offset_26|, ~y~0=v_~y~0_134, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_19|, ULTIMATE.start_main_~#t922~0.base=|v_ULTIMATE.start_main_~#t922~0.base_38|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t924~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t922~0.offset, ~y~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t923~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t923~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, ULTIMATE.start_main_~#t922~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:53:47,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) |v_ULTIMATE.start_main_~#t923~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t923~0.base_13| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t923~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t923~0.offset_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t923~0.offset, #length, ULTIMATE.start_main_~#t923~0.base] because there is no mapped edge [2019-12-07 13:53:47,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (not (= |v_ULTIMATE.start_main_~#t924~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t924~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t924~0.base_12| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) |v_ULTIMATE.start_main_~#t924~0.offset_10| 2))) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t924~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, #length] because there is no mapped edge [2019-12-07 13:53:47,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:53:47,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:53:47,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1870221026 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1870221026| |P1Thread1of1ForFork1_#t~ite8_Out-1870221026|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1870221026 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1870221026 256)) (and (= (mod ~y$w_buff1_used~0_In-1870221026 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In-1870221026 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite8_Out-1870221026| ~y$w_buff0~0_In-1870221026)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite8_In-1870221026| |P1Thread1of1ForFork1_#t~ite8_Out-1870221026|) (= |P1Thread1of1ForFork1_#t~ite9_Out-1870221026| ~y$w_buff0~0_In-1870221026)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1870221026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1870221026, ~y$w_buff0~0=~y$w_buff0~0_In-1870221026, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1870221026, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-1870221026|, ~weak$$choice2~0=~weak$$choice2~0_In-1870221026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1870221026} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1870221026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1870221026, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1870221026|, ~y$w_buff0~0=~y$w_buff0~0_In-1870221026, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1870221026, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-1870221026|, ~weak$$choice2~0=~weak$$choice2~0_In-1870221026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1870221026} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:53:47,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:53:47,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1997920202 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-1997920202| |P1Thread1of1ForFork1_#t~ite23_Out-1997920202|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-1997920202| ~y$r_buff1_thd2~0_In-1997920202)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1997920202| ~y$r_buff1_thd2~0_In-1997920202) (= |P1Thread1of1ForFork1_#t~ite24_Out-1997920202| |P1Thread1of1ForFork1_#t~ite23_Out-1997920202|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1997920202 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1997920202 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1997920202 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1997920202 256) 0)))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1997920202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997920202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1997920202|, ~weak$$choice2~0=~weak$$choice2~0_In-1997920202, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1997920202} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1997920202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997920202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1997920202|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1997920202|, ~weak$$choice2~0=~weak$$choice2~0_In-1997920202, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1997920202} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 13:53:47,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:53:47,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1138932279 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1138932279 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out1138932279| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1138932279 |P2Thread1of1ForFork2_#t~ite28_Out1138932279|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1138932279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1138932279} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1138932279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1138932279, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1138932279|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:53:47,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-10693696 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-10693696 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-10693696 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-10693696 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out-10693696| ~y$w_buff1_used~0_In-10693696)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-10693696|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-10693696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-10693696, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-10693696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-10693696} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-10693696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-10693696, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-10693696, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-10693696|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-10693696} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:53:47,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In987979922 256))) (.cse0 (= ~y$r_buff0_thd3~0_In987979922 ~y$r_buff0_thd3~0_Out987979922)) (.cse2 (= (mod ~y$w_buff0_used~0_In987979922 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out987979922)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In987979922, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In987979922} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In987979922, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out987979922|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out987979922} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 13:53:47,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-81080734 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-81080734 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-81080734 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-81080734 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-81080734|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd3~0_In-81080734 |P2Thread1of1ForFork2_#t~ite31_Out-81080734|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-81080734, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-81080734, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-81080734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81080734} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-81080734, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-81080734, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-81080734|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-81080734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81080734} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:53:47,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:53:47,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:53:47,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1011290037 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1011290037 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out1011290037| ~y~0_In1011290037) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out1011290037| ~y$w_buff1~0_In1011290037) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y~0=~y~0_In1011290037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1011290037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1011290037, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1011290037|, ~y~0=~y~0_In1011290037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1011290037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 13:53:47,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 13:53:47,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-46855129 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-46855129 256) 0))) (or (and (= ~y$w_buff0_used~0_In-46855129 |ULTIMATE.start_main_#t~ite37_Out-46855129|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-46855129|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-46855129} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-46855129, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-46855129|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:53:47,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1699082295 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1699082295 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1699082295 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1699082295 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out-1699082295| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1699082295| ~y$w_buff1_used~0_In-1699082295) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699082295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1699082295, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1699082295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699082295} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699082295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1699082295, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1699082295|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1699082295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699082295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:53:47,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1171918978 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1171918978 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1171918978| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1171918978| ~y$r_buff0_thd0~0_In1171918978)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1171918978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1171918978} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1171918978, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1171918978|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1171918978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:53:47,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In2121659578 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2121659578 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2121659578 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2121659578 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2121659578| ~y$r_buff1_thd0~0_In2121659578) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite40_Out2121659578|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2121659578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2121659578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2121659578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121659578} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2121659578|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121659578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2121659578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2121659578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121659578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:53:47,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_84 0) (= 1 v_~__unbuffered_p2_EAX~0_84) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:53:47,953 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4ad0e6ab-e842-44d9-a2f0-5a6759dbf442/bin/uautomizer/witness.graphml [2019-12-07 13:53:47,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:53:47,954 INFO L168 Benchmark]: Toolchain (without parser) took 10393.91 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 653.3 MB). Free memory was 940.9 MB in the beginning and 1.5 GB in the end (delta: -518.6 MB). Peak memory consumption was 934.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:47,954 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:53:47,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -133.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:47,955 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:47,955 INFO L168 Benchmark]: Boogie Preprocessor took 23.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:53:47,955 INFO L168 Benchmark]: RCFGBuilder took 369.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:47,956 INFO L168 Benchmark]: TraceAbstraction took 9481.24 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 527.4 MB). Free memory was 1.0 GB in the beginning and 659.5 MB in the end (delta: 359.9 MB). Peak memory consumption was 887.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:47,956 INFO L168 Benchmark]: Witness Printer took 89.94 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 17.8 MB). Free memory was 659.5 MB in the beginning and 1.5 GB in the end (delta: -799.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:47,958 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -133.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 369.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9481.24 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 527.4 MB). Free memory was 1.0 GB in the beginning and 659.5 MB in the end (delta: 359.9 MB). Peak memory consumption was 887.3 MB. Max. memory is 11.5 GB. * Witness Printer took 89.94 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 17.8 MB). Free memory was 659.5 MB in the beginning and 1.5 GB in the end (delta: -799.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 154 ProgramPointsBefore, 71 ProgramPointsAfterwards, 179 TransitionsBefore, 79 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 21 ChoiceCompositions, 4868 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 174 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 44280 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 1 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L750] 2 x = 1 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1613 SDtfs, 1718 SDslu, 2228 SDs, 0 SdLazy, 1400 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18470occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 14441 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 84475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...