./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_power.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_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/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 7daf64d82ddacd7bc1ccf73527b07db58b3fb4c0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 17:10:22,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:10:22,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:10:22,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:10:22,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:10:22,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:10:22,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:10:22,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:10:22,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:10:22,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:10:22,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:10:22,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:10:22,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:10:22,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:10:22,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:10:22,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:10:22,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:10:22,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:10:22,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:10:22,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:10:22,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:10:22,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:10:22,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:10:22,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:10:22,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:10:22,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:10:22,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:10:22,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:10:22,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:10:22,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:10:22,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:10:22,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:10:22,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:10:22,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:10:22,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:10:22,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:10:22,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:10:22,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:10:22,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:10:22,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:10:22,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:10:22,520 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:10:22,532 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:10:22,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:10:22,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:10:22,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:10:22,534 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:10:22,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:10:22,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:10:22,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:10:22,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:10:22,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:10:22,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:10:22,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:10:22,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:10:22,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:10:22,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:10:22,536 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:10:22,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:10:22,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:10:22,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:10:22,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:10:22,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:10:22,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:10:22,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:10:22,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:10:22,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:10:22,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:10:22,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:10:22,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:10:22,538 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:10:22,538 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_c690069e-45f5-499c-8d2d-fe5b147a836b/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 -> 7daf64d82ddacd7bc1ccf73527b07db58b3fb4c0 [2019-12-07 17:10:22,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:10:22,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:10:22,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:10:22,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:10:22,673 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:10:22,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix034_power.opt.i [2019-12-07 17:10:22,721 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/data/461f88e39/f7e2955b69dc45a6bdd3520fd443c0a9/FLAG86ceae8b4 [2019-12-07 17:10:23,131 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:10:23,132 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/sv-benchmarks/c/pthread-wmm/mix034_power.opt.i [2019-12-07 17:10:23,143 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/data/461f88e39/f7e2955b69dc45a6bdd3520fd443c0a9/FLAG86ceae8b4 [2019-12-07 17:10:23,495 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/data/461f88e39/f7e2955b69dc45a6bdd3520fd443c0a9 [2019-12-07 17:10:23,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:10:23,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:10:23,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:23,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:10:23,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:10:23,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77919ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23, skipping insertion in model container [2019-12-07 17:10:23,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:10:23,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:10:23,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:23,793 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:10:23,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:23,878 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:10:23,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23 WrapperNode [2019-12-07 17:10:23,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:23,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:10:23,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:10:23,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:10:23,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:10:23,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:10:23,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:10:23,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:10:23,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... [2019-12-07 17:10:23,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:10:23,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:10:23,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:10:23,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:10:23,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/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 17:10:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:10:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:10:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:10:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:10:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:10:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:10:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:10:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:10:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:10:23,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:10:23,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:10:23,984 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 17:10:24,316 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:10:24,317 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:10:24,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:24 BoogieIcfgContainer [2019-12-07 17:10:24,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:10:24,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:10:24,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:10:24,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:10:24,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:10:23" (1/3) ... [2019-12-07 17:10:24,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e3264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:24, skipping insertion in model container [2019-12-07 17:10:24,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:23" (2/3) ... [2019-12-07 17:10:24,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e3264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:24, skipping insertion in model container [2019-12-07 17:10:24,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:24" (3/3) ... [2019-12-07 17:10:24,322 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.opt.i [2019-12-07 17:10:24,328 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:10:24,328 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:10:24,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:10:24,333 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:10:24,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,362 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,362 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:24,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:10:24,396 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:10:24,396 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:10:24,396 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:10:24,396 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:10:24,396 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:10:24,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:10:24,397 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:10:24,397 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:10:24,407 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-07 17:10:24,408 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-07 17:10:24,455 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-07 17:10:24,455 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:10:24,463 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:10:24,474 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-07 17:10:24,500 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-07 17:10:24,500 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:10:24,503 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:10:24,514 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:10:24,515 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:10:27,324 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 17:10:27,573 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-07 17:10:27,573 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-07 17:10:27,576 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-07 17:10:27,935 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-07 17:10:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-07 17:10:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:10:27,941 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:27,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:10:27,942 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-07 17:10:27,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:27,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328619947] [2019-12-07 17:10:27,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:28,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328619947] [2019-12-07 17:10:28,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:28,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:10:28,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332876025] [2019-12-07 17:10:28,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:28,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:28,127 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-07 17:10:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:28,294 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-07 17:10:28,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:28,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:10:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:28,363 INFO L225 Difference]: With dead ends: 8598 [2019-12-07 17:10:28,364 INFO L226 Difference]: Without dead ends: 7662 [2019-12-07 17:10:28,365 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 17:10:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-07 17:10:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-07 17:10:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-07 17:10:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-07 17:10:28,631 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-07 17:10:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:28,632 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-07 17:10:28,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-07 17:10:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:10:28,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:28,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:28,635 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:28,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-07 17:10:28,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:28,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104642662] [2019-12-07 17:10:28,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:28,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104642662] [2019-12-07 17:10:28,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:28,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:28,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847102871] [2019-12-07 17:10:28,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:28,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:28,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:28,711 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 4 states. [2019-12-07 17:10:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:28,960 INFO L93 Difference]: Finished difference Result 11648 states and 36322 transitions. [2019-12-07 17:10:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:28,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:10:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:29,008 INFO L225 Difference]: With dead ends: 11648 [2019-12-07 17:10:29,009 INFO L226 Difference]: Without dead ends: 11634 [2019-12-07 17:10:29,009 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 17:10:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2019-12-07 17:10:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 10434. [2019-12-07 17:10:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10434 states. [2019-12-07 17:10:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10434 states to 10434 states and 33156 transitions. [2019-12-07 17:10:29,242 INFO L78 Accepts]: Start accepts. Automaton has 10434 states and 33156 transitions. Word has length 11 [2019-12-07 17:10:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:29,242 INFO L462 AbstractCegarLoop]: Abstraction has 10434 states and 33156 transitions. [2019-12-07 17:10:29,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 10434 states and 33156 transitions. [2019-12-07 17:10:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:10:29,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:29,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:29,246 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:29,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-07 17:10:29,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:29,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807289736] [2019-12-07 17:10:29,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:29,276 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 17:10:29,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807289736] [2019-12-07 17:10:29,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:29,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:29,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151741564] [2019-12-07 17:10:29,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:29,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:29,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:29,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:29,278 INFO L87 Difference]: Start difference. First operand 10434 states and 33156 transitions. Second operand 3 states. [2019-12-07 17:10:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:29,366 INFO L93 Difference]: Finished difference Result 15676 states and 49653 transitions. [2019-12-07 17:10:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:29,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:10:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:29,398 INFO L225 Difference]: With dead ends: 15676 [2019-12-07 17:10:29,398 INFO L226 Difference]: Without dead ends: 15676 [2019-12-07 17:10:29,398 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 17:10:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15676 states. [2019-12-07 17:10:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15676 to 11940. [2019-12-07 17:10:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11940 states. [2019-12-07 17:10:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 38316 transitions. [2019-12-07 17:10:29,655 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 38316 transitions. Word has length 14 [2019-12-07 17:10:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:29,656 INFO L462 AbstractCegarLoop]: Abstraction has 11940 states and 38316 transitions. [2019-12-07 17:10:29,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 38316 transitions. [2019-12-07 17:10:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:10:29,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:29,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:29,658 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-07 17:10:29,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:29,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995575571] [2019-12-07 17:10:29,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:29,714 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 17:10:29,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995575571] [2019-12-07 17:10:29,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:29,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:29,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710111279] [2019-12-07 17:10:29,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:29,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:29,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:29,716 INFO L87 Difference]: Start difference. First operand 11940 states and 38316 transitions. Second operand 4 states. [2019-12-07 17:10:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:29,883 INFO L93 Difference]: Finished difference Result 14601 states and 46104 transitions. [2019-12-07 17:10:29,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:29,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:10:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:29,910 INFO L225 Difference]: With dead ends: 14601 [2019-12-07 17:10:29,910 INFO L226 Difference]: Without dead ends: 14601 [2019-12-07 17:10:29,910 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 17:10:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2019-12-07 17:10:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 13192. [2019-12-07 17:10:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-12-07 17:10:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 42090 transitions. [2019-12-07 17:10:30,136 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 42090 transitions. Word has length 14 [2019-12-07 17:10:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:30,136 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 42090 transitions. [2019-12-07 17:10:30,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 42090 transitions. [2019-12-07 17:10:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:10:30,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:30,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:30,138 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:30,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:30,138 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-07 17:10:30,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:30,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708214893] [2019-12-07 17:10:30,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:30,172 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 17:10:30,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708214893] [2019-12-07 17:10:30,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:30,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:30,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063180034] [2019-12-07 17:10:30,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:30,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:30,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:30,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:30,173 INFO L87 Difference]: Start difference. First operand 13192 states and 42090 transitions. Second operand 4 states. [2019-12-07 17:10:30,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:30,317 INFO L93 Difference]: Finished difference Result 15525 states and 49066 transitions. [2019-12-07 17:10:30,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:30,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:10:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:30,338 INFO L225 Difference]: With dead ends: 15525 [2019-12-07 17:10:30,338 INFO L226 Difference]: Without dead ends: 15525 [2019-12-07 17:10:30,339 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 17:10:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15525 states. [2019-12-07 17:10:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15525 to 13326. [2019-12-07 17:10:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13326 states. [2019-12-07 17:10:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13326 states to 13326 states and 42542 transitions. [2019-12-07 17:10:30,597 INFO L78 Accepts]: Start accepts. Automaton has 13326 states and 42542 transitions. Word has length 14 [2019-12-07 17:10:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:30,597 INFO L462 AbstractCegarLoop]: Abstraction has 13326 states and 42542 transitions. [2019-12-07 17:10:30,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 13326 states and 42542 transitions. [2019-12-07 17:10:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:10:30,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:30,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:30,600 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1158249311, now seen corresponding path program 1 times [2019-12-07 17:10:30,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:30,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47154489] [2019-12-07 17:10:30,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:30,649 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 17:10:30,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47154489] [2019-12-07 17:10:30,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:30,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:10:30,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847792404] [2019-12-07 17:10:30,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:30,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:30,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:30,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:30,651 INFO L87 Difference]: Start difference. First operand 13326 states and 42542 transitions. Second operand 3 states. [2019-12-07 17:10:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:30,697 INFO L93 Difference]: Finished difference Result 13301 states and 42468 transitions. [2019-12-07 17:10:30,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:30,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:10:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:30,714 INFO L225 Difference]: With dead ends: 13301 [2019-12-07 17:10:30,714 INFO L226 Difference]: Without dead ends: 13301 [2019-12-07 17:10:30,714 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 17:10:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13301 states. [2019-12-07 17:10:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13301 to 13301. [2019-12-07 17:10:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13301 states. [2019-12-07 17:10:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13301 states to 13301 states and 42468 transitions. [2019-12-07 17:10:30,919 INFO L78 Accepts]: Start accepts. Automaton has 13301 states and 42468 transitions. Word has length 16 [2019-12-07 17:10:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:30,919 INFO L462 AbstractCegarLoop]: Abstraction has 13301 states and 42468 transitions. [2019-12-07 17:10:30,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 13301 states and 42468 transitions. [2019-12-07 17:10:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:10:30,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:30,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:30,923 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:30,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:30,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1545984591, now seen corresponding path program 1 times [2019-12-07 17:10:30,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:30,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460675796] [2019-12-07 17:10:30,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:30,957 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 17:10:30,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460675796] [2019-12-07 17:10:30,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:30,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:30,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023124337] [2019-12-07 17:10:30,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:30,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:30,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:30,958 INFO L87 Difference]: Start difference. First operand 13301 states and 42468 transitions. Second operand 3 states. [2019-12-07 17:10:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:30,997 INFO L93 Difference]: Finished difference Result 12583 states and 39558 transitions. [2019-12-07 17:10:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:30,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:10:30,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:31,014 INFO L225 Difference]: With dead ends: 12583 [2019-12-07 17:10:31,014 INFO L226 Difference]: Without dead ends: 12583 [2019-12-07 17:10:31,014 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 17:10:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12583 states. [2019-12-07 17:10:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12583 to 12503. [2019-12-07 17:10:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12503 states. [2019-12-07 17:10:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12503 states to 12503 states and 39326 transitions. [2019-12-07 17:10:31,202 INFO L78 Accepts]: Start accepts. Automaton has 12503 states and 39326 transitions. Word has length 17 [2019-12-07 17:10:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:31,202 INFO L462 AbstractCegarLoop]: Abstraction has 12503 states and 39326 transitions. [2019-12-07 17:10:31,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 12503 states and 39326 transitions. [2019-12-07 17:10:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:10:31,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:31,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:31,205 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash 819852344, now seen corresponding path program 1 times [2019-12-07 17:10:31,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:31,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24326500] [2019-12-07 17:10:31,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:31,234 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 17:10:31,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24326500] [2019-12-07 17:10:31,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:31,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:31,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727167303] [2019-12-07 17:10:31,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:31,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:31,235 INFO L87 Difference]: Start difference. First operand 12503 states and 39326 transitions. Second operand 3 states. [2019-12-07 17:10:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:31,244 INFO L93 Difference]: Finished difference Result 1631 states and 3669 transitions. [2019-12-07 17:10:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:31,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:10:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:31,246 INFO L225 Difference]: With dead ends: 1631 [2019-12-07 17:10:31,246 INFO L226 Difference]: Without dead ends: 1631 [2019-12-07 17:10:31,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-12-07 17:10:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2019-12-07 17:10:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2019-12-07 17:10:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 3669 transitions. [2019-12-07 17:10:31,273 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 3669 transitions. Word has length 17 [2019-12-07 17:10:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:31,273 INFO L462 AbstractCegarLoop]: Abstraction has 1631 states and 3669 transitions. [2019-12-07 17:10:31,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 3669 transitions. [2019-12-07 17:10:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:10:31,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:31,274 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] [2019-12-07 17:10:31,275 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-07 17:10:31,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:31,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015568827] [2019-12-07 17:10:31,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:31,317 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 17:10:31,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015568827] [2019-12-07 17:10:31,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:31,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:31,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46721004] [2019-12-07 17:10:31,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:31,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:31,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:31,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:31,318 INFO L87 Difference]: Start difference. First operand 1631 states and 3669 transitions. Second operand 5 states. [2019-12-07 17:10:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:31,468 INFO L93 Difference]: Finished difference Result 2140 states and 4682 transitions. [2019-12-07 17:10:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:10:31,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 17:10:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:31,470 INFO L225 Difference]: With dead ends: 2140 [2019-12-07 17:10:31,470 INFO L226 Difference]: Without dead ends: 2140 [2019-12-07 17:10:31,470 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 17:10:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-07 17:10:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1699. [2019-12-07 17:10:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-12-07 17:10:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3809 transitions. [2019-12-07 17:10:31,491 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3809 transitions. Word has length 24 [2019-12-07 17:10:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:31,491 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 3809 transitions. [2019-12-07 17:10:31,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3809 transitions. [2019-12-07 17:10:31,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:10:31,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:31,493 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] [2019-12-07 17:10:31,493 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:31,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-07 17:10:31,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:31,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811986805] [2019-12-07 17:10:31,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:31,561 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 17:10:31,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811986805] [2019-12-07 17:10:31,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:31,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:31,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749086545] [2019-12-07 17:10:31,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:31,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:31,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:31,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:31,563 INFO L87 Difference]: Start difference. First operand 1699 states and 3809 transitions. Second operand 5 states. [2019-12-07 17:10:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:31,706 INFO L93 Difference]: Finished difference Result 2154 states and 4711 transitions. [2019-12-07 17:10:31,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:10:31,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 17:10:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:31,708 INFO L225 Difference]: With dead ends: 2154 [2019-12-07 17:10:31,708 INFO L226 Difference]: Without dead ends: 2154 [2019-12-07 17:10:31,708 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 17:10:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-12-07 17:10:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1645. [2019-12-07 17:10:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2019-12-07 17:10:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 3698 transitions. [2019-12-07 17:10:31,723 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 3698 transitions. Word has length 26 [2019-12-07 17:10:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:31,723 INFO L462 AbstractCegarLoop]: Abstraction has 1645 states and 3698 transitions. [2019-12-07 17:10:31,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 3698 transitions. [2019-12-07 17:10:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:10:31,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:31,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:31,724 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:31,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-07 17:10:31,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:31,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104484387] [2019-12-07 17:10:31,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:31,756 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 17:10:31,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104484387] [2019-12-07 17:10:31,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:31,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:31,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211356664] [2019-12-07 17:10:31,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:31,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:31,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:31,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:31,757 INFO L87 Difference]: Start difference. First operand 1645 states and 3698 transitions. Second operand 4 states. [2019-12-07 17:10:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:31,767 INFO L93 Difference]: Finished difference Result 797 states and 1775 transitions. [2019-12-07 17:10:31,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:31,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 17:10:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:31,768 INFO L225 Difference]: With dead ends: 797 [2019-12-07 17:10:31,768 INFO L226 Difference]: Without dead ends: 797 [2019-12-07 17:10:31,769 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 17:10:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-07 17:10:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-12-07 17:10:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-07 17:10:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1775 transitions. [2019-12-07 17:10:31,775 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1775 transitions. Word has length 28 [2019-12-07 17:10:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:31,776 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1775 transitions. [2019-12-07 17:10:31,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1775 transitions. [2019-12-07 17:10:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:10:31,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:31,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:31,777 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:31,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1237801842, now seen corresponding path program 1 times [2019-12-07 17:10:31,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:31,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853785686] [2019-12-07 17:10:31,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:31,837 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 17:10:31,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853785686] [2019-12-07 17:10:31,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:31,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:10:31,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777219251] [2019-12-07 17:10:31,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:10:31,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:31,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:10:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:10:31,839 INFO L87 Difference]: Start difference. First operand 797 states and 1775 transitions. Second operand 6 states. [2019-12-07 17:10:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:32,172 INFO L93 Difference]: Finished difference Result 1393 states and 2999 transitions. [2019-12-07 17:10:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:10:32,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 17:10:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:32,173 INFO L225 Difference]: With dead ends: 1393 [2019-12-07 17:10:32,173 INFO L226 Difference]: Without dead ends: 1393 [2019-12-07 17:10:32,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:10:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2019-12-07 17:10:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1070. [2019-12-07 17:10:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-12-07 17:10:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 2374 transitions. [2019-12-07 17:10:32,183 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 2374 transitions. Word has length 51 [2019-12-07 17:10:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:32,183 INFO L462 AbstractCegarLoop]: Abstraction has 1070 states and 2374 transitions. [2019-12-07 17:10:32,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:10:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 2374 transitions. [2019-12-07 17:10:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:10:32,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:32,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:32,185 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:32,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2123622504, now seen corresponding path program 2 times [2019-12-07 17:10:32,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:32,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316977986] [2019-12-07 17:10:32,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:32,221 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 17:10:32,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316977986] [2019-12-07 17:10:32,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:32,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:32,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414907140] [2019-12-07 17:10:32,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:32,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:32,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:32,223 INFO L87 Difference]: Start difference. First operand 1070 states and 2374 transitions. Second operand 3 states. [2019-12-07 17:10:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:32,257 INFO L93 Difference]: Finished difference Result 1308 states and 2876 transitions. [2019-12-07 17:10:32,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:32,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 17:10:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:32,259 INFO L225 Difference]: With dead ends: 1308 [2019-12-07 17:10:32,259 INFO L226 Difference]: Without dead ends: 1308 [2019-12-07 17:10:32,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 17:10:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-12-07 17:10:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1082. [2019-12-07 17:10:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-12-07 17:10:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 2405 transitions. [2019-12-07 17:10:32,274 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 2405 transitions. Word has length 51 [2019-12-07 17:10:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:32,275 INFO L462 AbstractCegarLoop]: Abstraction has 1082 states and 2405 transitions. [2019-12-07 17:10:32,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 2405 transitions. [2019-12-07 17:10:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:10:32,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:32,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:32,276 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:32,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash 953721779, now seen corresponding path program 1 times [2019-12-07 17:10:32,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:32,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198407507] [2019-12-07 17:10:32,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:32,466 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 17:10:32,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198407507] [2019-12-07 17:10:32,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:32,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:10:32,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477144131] [2019-12-07 17:10:32,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:10:32,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:32,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:10:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:10:32,468 INFO L87 Difference]: Start difference. First operand 1082 states and 2405 transitions. Second operand 12 states. [2019-12-07 17:10:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:34,185 INFO L93 Difference]: Finished difference Result 3163 states and 6740 transitions. [2019-12-07 17:10:34,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 17:10:34,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-12-07 17:10:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:34,186 INFO L225 Difference]: With dead ends: 3163 [2019-12-07 17:10:34,187 INFO L226 Difference]: Without dead ends: 1904 [2019-12-07 17:10:34,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 17:10:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2019-12-07 17:10:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1117. [2019-12-07 17:10:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2019-12-07 17:10:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 2502 transitions. [2019-12-07 17:10:34,198 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 2502 transitions. Word has length 52 [2019-12-07 17:10:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:34,198 INFO L462 AbstractCegarLoop]: Abstraction has 1117 states and 2502 transitions. [2019-12-07 17:10:34,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:10:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 2502 transitions. [2019-12-07 17:10:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:10:34,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:34,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:34,200 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1723838863, now seen corresponding path program 2 times [2019-12-07 17:10:34,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:34,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76003518] [2019-12-07 17:10:34,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:34,265 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 17:10:34,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76003518] [2019-12-07 17:10:34,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:34,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:10:34,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759168708] [2019-12-07 17:10:34,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:10:34,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:34,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:10:34,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:10:34,266 INFO L87 Difference]: Start difference. First operand 1117 states and 2502 transitions. Second operand 7 states. [2019-12-07 17:10:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:34,416 INFO L93 Difference]: Finished difference Result 2728 states and 5895 transitions. [2019-12-07 17:10:34,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:10:34,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:10:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:34,418 INFO L225 Difference]: With dead ends: 2728 [2019-12-07 17:10:34,418 INFO L226 Difference]: Without dead ends: 1984 [2019-12-07 17:10:34,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:10:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2019-12-07 17:10:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1139. [2019-12-07 17:10:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-12-07 17:10:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2528 transitions. [2019-12-07 17:10:34,431 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2528 transitions. Word has length 52 [2019-12-07 17:10:34,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:34,431 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 2528 transitions. [2019-12-07 17:10:34,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:10:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2528 transitions. [2019-12-07 17:10:34,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:10:34,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:34,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:34,432 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:34,433 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 3 times [2019-12-07 17:10:34,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:34,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813817672] [2019-12-07 17:10:34,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:10:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:10:34,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:10:34,503 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:10:34,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t899~0.base_35| 4) |v_#length_15|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35|) |v_ULTIMATE.start_main_~#t899~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t899~0.offset_24| 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35|) 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t899~0.base_35|) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t899~0.base=|v_ULTIMATE.start_main_~#t899~0.base_35|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_17|, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ULTIMATE.start_main_~#t899~0.offset=|v_ULTIMATE.start_main_~#t899~0.offset_24|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t899~0.base, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t900~0.base, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t900~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t899~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 17:10:34,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t900~0.base_13| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13|) |v_ULTIMATE.start_main_~#t900~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t900~0.base_13|) (= |v_ULTIMATE.start_main_~#t900~0.offset_11| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t900~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_13|, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t900~0.base, ULTIMATE.start_main_~#t900~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:10:34,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-892645428| (ite (not (and (not (= 0 (mod ~z$w_buff0_used~0_Out-892645428 256))) (not (= (mod ~z$w_buff1_used~0_Out-892645428 256) 0)))) 1 0)) (= 1 ~z$w_buff0~0_Out-892645428) (= ~z$w_buff1~0_Out-892645428 ~z$w_buff0~0_In-892645428) (= 1 ~z$w_buff0_used~0_Out-892645428) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-892645428 0)) (= ~z$w_buff1_used~0_Out-892645428 ~z$w_buff0_used~0_In-892645428) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-892645428| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-892645428) (= |P0Thread1of1ForFork0_#in~arg.offset_In-892645428| P0Thread1of1ForFork0_~arg.offset_Out-892645428) (= P0Thread1of1ForFork0_~arg.base_Out-892645428 |P0Thread1of1ForFork0_#in~arg.base_In-892645428|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-892645428|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-892645428, ~z$w_buff0~0=~z$w_buff0~0_In-892645428, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-892645428|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-892645428|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-892645428, ~z$w_buff0~0=~z$w_buff0~0_Out-892645428, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-892645428, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-892645428, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-892645428|, ~z$w_buff1~0=~z$w_buff1~0_Out-892645428, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-892645428, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-892645428|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-892645428} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:10:34,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1970495042 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out1970495042| |P1Thread1of1ForFork1_#t~ite24_Out1970495042|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1970495042 256)))) (or (and .cse0 (= (mod ~z$r_buff1_thd2~0_In1970495042 256) 0)) (= (mod ~z$w_buff0_used~0_In1970495042 256) 0) (and .cse0 (= (mod ~z$w_buff1_used~0_In1970495042 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1970495042| ~z$w_buff1_used~0_In1970495042)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out1970495042| ~z$w_buff1_used~0_In1970495042) (= |P1Thread1of1ForFork1_#t~ite23_In1970495042| |P1Thread1of1ForFork1_#t~ite23_Out1970495042|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1970495042, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1970495042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1970495042, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1970495042|, ~weak$$choice2~0=~weak$$choice2~0_In1970495042, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1970495042} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1970495042, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1970495042, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1970495042|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1970495042, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1970495042|, ~weak$$choice2~0=~weak$$choice2~0_In1970495042, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1970495042} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 17:10:34,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:10:34,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:10:34,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In415870612 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In415870612 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out415870612| ~z$w_buff0_used~0_In415870612) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out415870612|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In415870612, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In415870612} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out415870612|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In415870612, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In415870612} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:10:34,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In45777759 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In45777759 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In45777759 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In45777759 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out45777759| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out45777759| ~z$w_buff1_used~0_In45777759)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In45777759, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In45777759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In45777759, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In45777759} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out45777759|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In45777759, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In45777759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In45777759, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In45777759} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:10:34,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-452979125 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_In-452979125 ~z$r_buff0_thd1~0_Out-452979125)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-452979125 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-452979125) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-452979125, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-452979125} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-452979125, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-452979125|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-452979125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:10:34,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-1759558296 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1759558296 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1759558296 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1759558296 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1759558296|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-1759558296 |P0Thread1of1ForFork0_#t~ite8_Out-1759558296|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1759558296, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1759558296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1759558296, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1759558296} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1759558296, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1759558296|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1759558296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1759558296, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1759558296} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:10:34,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out240195216| |P1Thread1of1ForFork1_#t~ite32_Out240195216|)) (.cse1 (= (mod ~z$w_buff1_used~0_In240195216 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In240195216 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In240195216 |P1Thread1of1ForFork1_#t~ite32_Out240195216|)) (and .cse2 (= ~z$w_buff1~0_In240195216 |P1Thread1of1ForFork1_#t~ite32_Out240195216|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In240195216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In240195216, ~z$w_buff1~0=~z$w_buff1~0_In240195216, ~z~0=~z~0_In240195216} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In240195216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In240195216, ~z$w_buff1~0=~z$w_buff1~0_In240195216, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out240195216|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out240195216|, ~z~0=~z~0_In240195216} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:10:34,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In434934020 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In434934020 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out434934020| ~z$w_buff0_used~0_In434934020) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out434934020| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In434934020, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In434934020} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In434934020, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out434934020|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In434934020} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:10:34,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1815064958 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1815064958 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1815064958 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1815064958 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1815064958| ~z$w_buff1_used~0_In1815064958) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1815064958|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1815064958, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1815064958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1815064958, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1815064958} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1815064958, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1815064958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1815064958, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1815064958|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1815064958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:10:34,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1502959718 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1502959718 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1502959718|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1502959718 |P1Thread1of1ForFork1_#t~ite36_Out1502959718|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1502959718, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1502959718} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1502959718, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1502959718, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1502959718|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:10:34,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-908737971 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-908737971 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-908737971 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-908737971 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-908737971 |P1Thread1of1ForFork1_#t~ite37_Out-908737971|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-908737971|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-908737971, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-908737971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908737971, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-908737971} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-908737971, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-908737971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908737971, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-908737971, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-908737971|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:10:34,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:10:34,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:10:34,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:10:34,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1054422588 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1054422588 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1054422588| ~z~0_In1054422588) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1054422588| ~z$w_buff1~0_In1054422588)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1054422588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1054422588, ~z$w_buff1~0=~z$w_buff1~0_In1054422588, ~z~0=~z~0_In1054422588} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1054422588|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1054422588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1054422588, ~z$w_buff1~0=~z$w_buff1~0_In1054422588, ~z~0=~z~0_In1054422588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:10:34,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 17:10:34,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-205094618 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-205094618 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-205094618 |ULTIMATE.start_main_#t~ite42_Out-205094618|)) (and (= |ULTIMATE.start_main_#t~ite42_Out-205094618| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-205094618, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-205094618} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-205094618, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-205094618, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-205094618|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:10:34,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In391462659 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In391462659 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In391462659 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In391462659 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out391462659|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In391462659 |ULTIMATE.start_main_#t~ite43_Out391462659|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In391462659, ~z$w_buff0_used~0=~z$w_buff0_used~0_In391462659, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In391462659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In391462659} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In391462659, ~z$w_buff0_used~0=~z$w_buff0_used~0_In391462659, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In391462659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In391462659, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out391462659|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:10:34,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1861354638 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1861354638 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1861354638| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1861354638| ~z$r_buff0_thd0~0_In-1861354638) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1861354638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1861354638} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1861354638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1861354638, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1861354638|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:10:34,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1749955466 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1749955466 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1749955466 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1749955466 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1749955466| ~z$r_buff1_thd0~0_In1749955466) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1749955466| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749955466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749955466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749955466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749955466} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749955466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749955466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749955466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749955466, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1749955466|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:10:34,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:10:34,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:10:34 BasicIcfg [2019-12-07 17:10:34,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:10:34,569 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:10:34,569 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:10:34,569 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:10:34,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:24" (3/4) ... [2019-12-07 17:10:34,572 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:10:34,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t899~0.base_35| 4) |v_#length_15|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35|) |v_ULTIMATE.start_main_~#t899~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t899~0.offset_24| 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35|) 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t899~0.base_35|) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t899~0.base=|v_ULTIMATE.start_main_~#t899~0.base_35|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_17|, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ULTIMATE.start_main_~#t899~0.offset=|v_ULTIMATE.start_main_~#t899~0.offset_24|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t899~0.base, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t900~0.base, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t900~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t899~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 17:10:34,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t900~0.base_13| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13|) |v_ULTIMATE.start_main_~#t900~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t900~0.base_13|) (= |v_ULTIMATE.start_main_~#t900~0.offset_11| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t900~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_13|, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t900~0.base, ULTIMATE.start_main_~#t900~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:10:34,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-892645428| (ite (not (and (not (= 0 (mod ~z$w_buff0_used~0_Out-892645428 256))) (not (= (mod ~z$w_buff1_used~0_Out-892645428 256) 0)))) 1 0)) (= 1 ~z$w_buff0~0_Out-892645428) (= ~z$w_buff1~0_Out-892645428 ~z$w_buff0~0_In-892645428) (= 1 ~z$w_buff0_used~0_Out-892645428) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-892645428 0)) (= ~z$w_buff1_used~0_Out-892645428 ~z$w_buff0_used~0_In-892645428) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-892645428| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-892645428) (= |P0Thread1of1ForFork0_#in~arg.offset_In-892645428| P0Thread1of1ForFork0_~arg.offset_Out-892645428) (= P0Thread1of1ForFork0_~arg.base_Out-892645428 |P0Thread1of1ForFork0_#in~arg.base_In-892645428|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-892645428|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-892645428, ~z$w_buff0~0=~z$w_buff0~0_In-892645428, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-892645428|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-892645428|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-892645428, ~z$w_buff0~0=~z$w_buff0~0_Out-892645428, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-892645428, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-892645428, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-892645428|, ~z$w_buff1~0=~z$w_buff1~0_Out-892645428, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-892645428, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-892645428|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-892645428} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:10:34,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1970495042 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out1970495042| |P1Thread1of1ForFork1_#t~ite24_Out1970495042|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1970495042 256)))) (or (and .cse0 (= (mod ~z$r_buff1_thd2~0_In1970495042 256) 0)) (= (mod ~z$w_buff0_used~0_In1970495042 256) 0) (and .cse0 (= (mod ~z$w_buff1_used~0_In1970495042 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1970495042| ~z$w_buff1_used~0_In1970495042)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out1970495042| ~z$w_buff1_used~0_In1970495042) (= |P1Thread1of1ForFork1_#t~ite23_In1970495042| |P1Thread1of1ForFork1_#t~ite23_Out1970495042|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1970495042, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1970495042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1970495042, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1970495042|, ~weak$$choice2~0=~weak$$choice2~0_In1970495042, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1970495042} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1970495042, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1970495042, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1970495042|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1970495042, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1970495042|, ~weak$$choice2~0=~weak$$choice2~0_In1970495042, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1970495042} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 17:10:34,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:10:34,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:10:34,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In415870612 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In415870612 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out415870612| ~z$w_buff0_used~0_In415870612) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out415870612|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In415870612, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In415870612} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out415870612|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In415870612, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In415870612} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:10:34,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In45777759 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In45777759 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In45777759 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In45777759 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out45777759| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out45777759| ~z$w_buff1_used~0_In45777759)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In45777759, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In45777759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In45777759, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In45777759} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out45777759|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In45777759, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In45777759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In45777759, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In45777759} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:10:34,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-452979125 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_In-452979125 ~z$r_buff0_thd1~0_Out-452979125)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-452979125 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-452979125) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-452979125, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-452979125} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-452979125, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-452979125|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-452979125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:10:34,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-1759558296 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1759558296 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1759558296 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1759558296 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1759558296|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-1759558296 |P0Thread1of1ForFork0_#t~ite8_Out-1759558296|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1759558296, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1759558296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1759558296, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1759558296} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1759558296, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1759558296|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1759558296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1759558296, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1759558296} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:10:34,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out240195216| |P1Thread1of1ForFork1_#t~ite32_Out240195216|)) (.cse1 (= (mod ~z$w_buff1_used~0_In240195216 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In240195216 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In240195216 |P1Thread1of1ForFork1_#t~ite32_Out240195216|)) (and .cse2 (= ~z$w_buff1~0_In240195216 |P1Thread1of1ForFork1_#t~ite32_Out240195216|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In240195216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In240195216, ~z$w_buff1~0=~z$w_buff1~0_In240195216, ~z~0=~z~0_In240195216} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In240195216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In240195216, ~z$w_buff1~0=~z$w_buff1~0_In240195216, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out240195216|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out240195216|, ~z~0=~z~0_In240195216} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:10:34,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In434934020 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In434934020 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out434934020| ~z$w_buff0_used~0_In434934020) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out434934020| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In434934020, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In434934020} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In434934020, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out434934020|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In434934020} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:10:34,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1815064958 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1815064958 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1815064958 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1815064958 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1815064958| ~z$w_buff1_used~0_In1815064958) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1815064958|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1815064958, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1815064958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1815064958, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1815064958} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1815064958, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1815064958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1815064958, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1815064958|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1815064958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:10:34,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1502959718 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1502959718 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1502959718|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1502959718 |P1Thread1of1ForFork1_#t~ite36_Out1502959718|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1502959718, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1502959718} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1502959718, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1502959718, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1502959718|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:10:34,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-908737971 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-908737971 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-908737971 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-908737971 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-908737971 |P1Thread1of1ForFork1_#t~ite37_Out-908737971|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-908737971|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-908737971, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-908737971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908737971, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-908737971} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-908737971, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-908737971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908737971, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-908737971, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-908737971|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:10:34,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:10:34,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:10:34,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:10:34,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1054422588 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1054422588 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1054422588| ~z~0_In1054422588) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1054422588| ~z$w_buff1~0_In1054422588)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1054422588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1054422588, ~z$w_buff1~0=~z$w_buff1~0_In1054422588, ~z~0=~z~0_In1054422588} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1054422588|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1054422588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1054422588, ~z$w_buff1~0=~z$w_buff1~0_In1054422588, ~z~0=~z~0_In1054422588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:10:34,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 17:10:34,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-205094618 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-205094618 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-205094618 |ULTIMATE.start_main_#t~ite42_Out-205094618|)) (and (= |ULTIMATE.start_main_#t~ite42_Out-205094618| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-205094618, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-205094618} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-205094618, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-205094618, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-205094618|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:10:34,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In391462659 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In391462659 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In391462659 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In391462659 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out391462659|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In391462659 |ULTIMATE.start_main_#t~ite43_Out391462659|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In391462659, ~z$w_buff0_used~0=~z$w_buff0_used~0_In391462659, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In391462659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In391462659} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In391462659, ~z$w_buff0_used~0=~z$w_buff0_used~0_In391462659, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In391462659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In391462659, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out391462659|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:10:34,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1861354638 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1861354638 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1861354638| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1861354638| ~z$r_buff0_thd0~0_In-1861354638) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1861354638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1861354638} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1861354638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1861354638, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1861354638|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:10:34,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1749955466 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1749955466 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1749955466 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1749955466 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1749955466| ~z$r_buff1_thd0~0_In1749955466) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1749955466| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749955466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749955466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749955466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749955466} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749955466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749955466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749955466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749955466, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1749955466|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:10:34,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:10:34,641 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c690069e-45f5-499c-8d2d-fe5b147a836b/bin/uautomizer/witness.graphml [2019-12-07 17:10:34,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:10:34,643 INFO L168 Benchmark]: Toolchain (without parser) took 11142.82 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 523.2 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -274.4 MB). Peak memory consumption was 248.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:34,643 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:10:34,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -109.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:34,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:34,644 INFO L168 Benchmark]: Boogie Preprocessor took 24.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:10:34,644 INFO L168 Benchmark]: RCFGBuilder took 378.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:34,645 INFO L168 Benchmark]: TraceAbstraction took 10250.43 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 451.4 MB). Free memory was 988.1 MB in the beginning and 1.2 GB in the end (delta: -238.9 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:34,645 INFO L168 Benchmark]: Witness Printer took 72.83 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:34,647 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -109.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 378.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10250.43 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 451.4 MB). Free memory was 988.1 MB in the beginning and 1.2 GB in the end (delta: -238.9 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. * Witness Printer took 72.83 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t899, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t900, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2148 SDtfs, 1712 SDslu, 5097 SDs, 0 SdLazy, 4192 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13326occurred 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: 1.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 11755 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 52763 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...