./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/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 d320affbb4ad9233eaa9e0f09929715ad0605f8c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 11:38:26,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:38:26,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:38:26,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:38:26,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:38:26,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:38:26,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:38:26,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:38:26,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:38:26,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:38:26,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:38:26,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:38:26,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:38:26,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:38:26,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:38:26,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:38:26,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:38:26,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:38:26,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:38:26,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:38:26,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:38:26,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:38:26,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:38:26,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:38:26,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:38:26,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:38:26,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:38:26,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:38:26,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:38:26,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:38:26,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:38:26,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:38:26,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:38:26,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:38:26,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:38:26,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:38:26,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:38:26,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:38:26,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:38:26,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:38:26,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:38:26,985 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:38:26,996 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:38:26,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:38:26,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:38:26,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:38:26,998 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:38:26,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:38:26,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:38:26,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:38:26,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:38:26,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:38:26,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:38:26,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:38:26,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:38:26,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:38:26,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:38:26,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:38:26,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:38:27,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:38:27,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:38:27,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:38:27,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:38:27,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:38:27,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:38:27,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:38:27,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:38:27,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:38:27,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:38:27,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:38:27,001 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:38:27,001 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_51228905-9cc3-4a85-8081-da2f9afd078f/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 -> d320affbb4ad9233eaa9e0f09929715ad0605f8c [2019-12-07 11:38:27,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:38:27,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:38:27,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:38:27,113 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:38:27,113 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:38:27,114 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i [2019-12-07 11:38:27,159 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/data/e444935fe/6eb5c86afc364a2bb91c423126c36c52/FLAG71b7b0f33 [2019-12-07 11:38:27,582 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:38:27,583 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i [2019-12-07 11:38:27,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/data/e444935fe/6eb5c86afc364a2bb91c423126c36c52/FLAG71b7b0f33 [2019-12-07 11:38:27,940 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/data/e444935fe/6eb5c86afc364a2bb91c423126c36c52 [2019-12-07 11:38:27,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:38:27,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:38:27,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:38:27,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:38:27,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:38:27,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:38:27" (1/1) ... [2019-12-07 11:38:27,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf817c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:27, skipping insertion in model container [2019-12-07 11:38:27,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:38:27" (1/1) ... [2019-12-07 11:38:27,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:38:27,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:38:28,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:38:28,227 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:38:28,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:38:28,313 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:38:28,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28 WrapperNode [2019-12-07 11:38:28,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:38:28,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:38:28,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:38:28,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:38:28,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... [2019-12-07 11:38:28,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... [2019-12-07 11:38:28,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:38:28,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:38:28,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:38:28,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:38:28,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... [2019-12-07 11:38:28,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... [2019-12-07 11:38:28,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... [2019-12-07 11:38:28,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... [2019-12-07 11:38:28,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... [2019-12-07 11:38:28,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... [2019-12-07 11:38:28,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... [2019-12-07 11:38:28,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:38:28,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:38:28,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:38:28,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:38:28,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/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 11:38:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:38:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:38:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:38:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:38:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:38:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:38:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:38:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:38:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:38:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:38:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:38:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:38:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:38:28,425 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 11:38:28,755 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:38:28,755 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:38:28,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:38:28 BoogieIcfgContainer [2019-12-07 11:38:28,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:38:28,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:38:28,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:38:28,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:38:28,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:38:27" (1/3) ... [2019-12-07 11:38:28,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e7d249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:38:28, skipping insertion in model container [2019-12-07 11:38:28,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:28" (2/3) ... [2019-12-07 11:38:28,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e7d249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:38:28, skipping insertion in model container [2019-12-07 11:38:28,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:38:28" (3/3) ... [2019-12-07 11:38:28,761 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt.i [2019-12-07 11:38:28,767 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:38:28,767 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:38:28,771 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:38:28,772 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:38:28,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,797 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,797 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,799 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,799 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:28,824 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:38:28,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:38:28,836 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:38:28,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:38:28,837 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:38:28,837 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:38:28,837 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:38:28,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:38:28,837 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:38:28,847 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-07 11:38:28,848 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 11:38:28,895 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 11:38:28,895 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:38:28,904 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 11:38:28,915 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 11:38:28,940 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 11:38:28,940 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:38:28,943 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 11:38:28,953 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 11:38:28,954 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:38:31,544 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 11:38:31,648 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39870 [2019-12-07 11:38:31,648 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-07 11:38:31,651 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 80 transitions [2019-12-07 11:38:32,159 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12726 states. [2019-12-07 11:38:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12726 states. [2019-12-07 11:38:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:38:32,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:32,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:32,165 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash -534032227, now seen corresponding path program 1 times [2019-12-07 11:38:32,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:32,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811536071] [2019-12-07 11:38:32,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:32,327 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 11:38:32,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811536071] [2019-12-07 11:38:32,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:32,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:38:32,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827975129] [2019-12-07 11:38:32,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:32,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:32,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:32,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:32,348 INFO L87 Difference]: Start difference. First operand 12726 states. Second operand 3 states. [2019-12-07 11:38:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:32,551 INFO L93 Difference]: Finished difference Result 12374 states and 47232 transitions. [2019-12-07 11:38:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:32,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:38:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:32,644 INFO L225 Difference]: With dead ends: 12374 [2019-12-07 11:38:32,644 INFO L226 Difference]: Without dead ends: 11654 [2019-12-07 11:38:32,645 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 11:38:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11654 states. [2019-12-07 11:38:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11654 to 11654. [2019-12-07 11:38:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11654 states. [2019-12-07 11:38:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 44412 transitions. [2019-12-07 11:38:33,099 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 44412 transitions. Word has length 7 [2019-12-07 11:38:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:33,100 INFO L462 AbstractCegarLoop]: Abstraction has 11654 states and 44412 transitions. [2019-12-07 11:38:33,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 44412 transitions. [2019-12-07 11:38:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:38:33,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:33,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:33,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:33,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:33,104 INFO L82 PathProgramCache]: Analyzing trace with hash 633204052, now seen corresponding path program 1 times [2019-12-07 11:38:33,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:33,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280552786] [2019-12-07 11:38:33,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:33,179 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 11:38:33,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280552786] [2019-12-07 11:38:33,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:33,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:33,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518545043] [2019-12-07 11:38:33,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:33,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:33,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:33,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:33,181 INFO L87 Difference]: Start difference. First operand 11654 states and 44412 transitions. Second operand 4 states. [2019-12-07 11:38:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:33,504 INFO L93 Difference]: Finished difference Result 17566 states and 64596 transitions. [2019-12-07 11:38:33,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:33,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:38:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:33,562 INFO L225 Difference]: With dead ends: 17566 [2019-12-07 11:38:33,563 INFO L226 Difference]: Without dead ends: 17538 [2019-12-07 11:38:33,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:38:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17538 states. [2019-12-07 11:38:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17538 to 15872. [2019-12-07 11:38:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15872 states. [2019-12-07 11:38:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15872 states to 15872 states and 59183 transitions. [2019-12-07 11:38:33,950 INFO L78 Accepts]: Start accepts. Automaton has 15872 states and 59183 transitions. Word has length 13 [2019-12-07 11:38:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:33,950 INFO L462 AbstractCegarLoop]: Abstraction has 15872 states and 59183 transitions. [2019-12-07 11:38:33,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 15872 states and 59183 transitions. [2019-12-07 11:38:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:38:33,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:33,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:33,957 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1912379884, now seen corresponding path program 1 times [2019-12-07 11:38:33,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:33,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005558795] [2019-12-07 11:38:33,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:34,082 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 11:38:34,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005558795] [2019-12-07 11:38:34,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:34,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:34,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730148392] [2019-12-07 11:38:34,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:34,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:34,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:34,083 INFO L87 Difference]: Start difference. First operand 15872 states and 59183 transitions. Second operand 4 states. [2019-12-07 11:38:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:34,280 INFO L93 Difference]: Finished difference Result 20884 states and 77167 transitions. [2019-12-07 11:38:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:34,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:38:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:34,370 INFO L225 Difference]: With dead ends: 20884 [2019-12-07 11:38:34,370 INFO L226 Difference]: Without dead ends: 20858 [2019-12-07 11:38:34,370 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 11:38:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20858 states. [2019-12-07 11:38:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20858 to 18074. [2019-12-07 11:38:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18074 states. [2019-12-07 11:38:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18074 states to 18074 states and 67346 transitions. [2019-12-07 11:38:34,734 INFO L78 Accepts]: Start accepts. Automaton has 18074 states and 67346 transitions. Word has length 16 [2019-12-07 11:38:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:34,734 INFO L462 AbstractCegarLoop]: Abstraction has 18074 states and 67346 transitions. [2019-12-07 11:38:34,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 18074 states and 67346 transitions. [2019-12-07 11:38:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:38:34,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:34,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:34,738 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:34,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:34,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1912467552, now seen corresponding path program 1 times [2019-12-07 11:38:34,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:34,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240548049] [2019-12-07 11:38:34,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:34,793 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 11:38:34,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240548049] [2019-12-07 11:38:34,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:34,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:34,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101107855] [2019-12-07 11:38:34,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:34,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:34,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:34,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:34,795 INFO L87 Difference]: Start difference. First operand 18074 states and 67346 transitions. Second operand 4 states. [2019-12-07 11:38:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:35,008 INFO L93 Difference]: Finished difference Result 22456 states and 83013 transitions. [2019-12-07 11:38:35,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:35,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:38:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:35,044 INFO L225 Difference]: With dead ends: 22456 [2019-12-07 11:38:35,044 INFO L226 Difference]: Without dead ends: 22430 [2019-12-07 11:38:35,045 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 11:38:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2019-12-07 11:38:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 17846. [2019-12-07 11:38:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17846 states. [2019-12-07 11:38:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17846 states to 17846 states and 66430 transitions. [2019-12-07 11:38:35,395 INFO L78 Accepts]: Start accepts. Automaton has 17846 states and 66430 transitions. Word has length 16 [2019-12-07 11:38:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:35,396 INFO L462 AbstractCegarLoop]: Abstraction has 17846 states and 66430 transitions. [2019-12-07 11:38:35,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17846 states and 66430 transitions. [2019-12-07 11:38:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:38:35,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:35,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:35,400 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:35,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:35,400 INFO L82 PathProgramCache]: Analyzing trace with hash -478811358, now seen corresponding path program 1 times [2019-12-07 11:38:35,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:35,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080956912] [2019-12-07 11:38:35,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:35,449 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 11:38:35,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080956912] [2019-12-07 11:38:35,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:35,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:35,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054614207] [2019-12-07 11:38:35,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:35,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:35,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:35,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:35,450 INFO L87 Difference]: Start difference. First operand 17846 states and 66430 transitions. Second operand 3 states. [2019-12-07 11:38:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:35,513 INFO L93 Difference]: Finished difference Result 16910 states and 62086 transitions. [2019-12-07 11:38:35,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:35,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:38:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:35,541 INFO L225 Difference]: With dead ends: 16910 [2019-12-07 11:38:35,541 INFO L226 Difference]: Without dead ends: 16910 [2019-12-07 11:38:35,541 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 11:38:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16910 states. [2019-12-07 11:38:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16910 to 16670. [2019-12-07 11:38:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16670 states. [2019-12-07 11:38:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16670 states to 16670 states and 61270 transitions. [2019-12-07 11:38:35,945 INFO L78 Accepts]: Start accepts. Automaton has 16670 states and 61270 transitions. Word has length 18 [2019-12-07 11:38:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:35,945 INFO L462 AbstractCegarLoop]: Abstraction has 16670 states and 61270 transitions. [2019-12-07 11:38:35,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 16670 states and 61270 transitions. [2019-12-07 11:38:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:38:35,948 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:35,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:35,948 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:35,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:35,949 INFO L82 PathProgramCache]: Analyzing trace with hash -890198145, now seen corresponding path program 1 times [2019-12-07 11:38:35,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:35,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226723250] [2019-12-07 11:38:35,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:35,978 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 11:38:35,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226723250] [2019-12-07 11:38:35,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:35,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:38:35,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174756066] [2019-12-07 11:38:35,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:35,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:35,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:35,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:35,980 INFO L87 Difference]: Start difference. First operand 16670 states and 61270 transitions. Second operand 3 states. [2019-12-07 11:38:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:36,032 INFO L93 Difference]: Finished difference Result 16645 states and 61171 transitions. [2019-12-07 11:38:36,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:36,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:38:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:36,058 INFO L225 Difference]: With dead ends: 16645 [2019-12-07 11:38:36,058 INFO L226 Difference]: Without dead ends: 16645 [2019-12-07 11:38:36,058 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 11:38:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16645 states. [2019-12-07 11:38:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16645 to 16645. [2019-12-07 11:38:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16645 states. [2019-12-07 11:38:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16645 states to 16645 states and 61171 transitions. [2019-12-07 11:38:36,341 INFO L78 Accepts]: Start accepts. Automaton has 16645 states and 61171 transitions. Word has length 18 [2019-12-07 11:38:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:36,341 INFO L462 AbstractCegarLoop]: Abstraction has 16645 states and 61171 transitions. [2019-12-07 11:38:36,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 16645 states and 61171 transitions. [2019-12-07 11:38:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:38:36,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:36,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:36,345 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1530730374, now seen corresponding path program 1 times [2019-12-07 11:38:36,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:36,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473497415] [2019-12-07 11:38:36,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:36,370 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 11:38:36,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473497415] [2019-12-07 11:38:36,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:36,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:36,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479814771] [2019-12-07 11:38:36,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:36,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:36,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:36,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:36,371 INFO L87 Difference]: Start difference. First operand 16645 states and 61171 transitions. Second operand 3 states. [2019-12-07 11:38:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:36,401 INFO L93 Difference]: Finished difference Result 9653 states and 30923 transitions. [2019-12-07 11:38:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:36,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:38:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:36,413 INFO L225 Difference]: With dead ends: 9653 [2019-12-07 11:38:36,413 INFO L226 Difference]: Without dead ends: 9653 [2019-12-07 11:38:36,414 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 11:38:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2019-12-07 11:38:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 9653. [2019-12-07 11:38:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9653 states. [2019-12-07 11:38:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 30923 transitions. [2019-12-07 11:38:36,549 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 30923 transitions. Word has length 19 [2019-12-07 11:38:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:36,549 INFO L462 AbstractCegarLoop]: Abstraction has 9653 states and 30923 transitions. [2019-12-07 11:38:36,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 30923 transitions. [2019-12-07 11:38:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:38:36,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:36,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:36,551 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash -558804114, now seen corresponding path program 1 times [2019-12-07 11:38:36,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:36,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067011054] [2019-12-07 11:38:36,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:36,575 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 11:38:36,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067011054] [2019-12-07 11:38:36,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:36,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:36,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797123607] [2019-12-07 11:38:36,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:36,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:36,576 INFO L87 Difference]: Start difference. First operand 9653 states and 30923 transitions. Second operand 3 states. [2019-12-07 11:38:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:36,625 INFO L93 Difference]: Finished difference Result 17080 states and 54448 transitions. [2019-12-07 11:38:36,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:36,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:38:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:36,638 INFO L225 Difference]: With dead ends: 17080 [2019-12-07 11:38:36,639 INFO L226 Difference]: Without dead ends: 10116 [2019-12-07 11:38:36,639 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 11:38:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2019-12-07 11:38:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 10016. [2019-12-07 11:38:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10016 states. [2019-12-07 11:38:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10016 states to 10016 states and 30678 transitions. [2019-12-07 11:38:36,816 INFO L78 Accepts]: Start accepts. Automaton has 10016 states and 30678 transitions. Word has length 19 [2019-12-07 11:38:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:36,816 INFO L462 AbstractCegarLoop]: Abstraction has 10016 states and 30678 transitions. [2019-12-07 11:38:36,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 10016 states and 30678 transitions. [2019-12-07 11:38:36,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:38:36,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:36,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:36,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:36,819 INFO L82 PathProgramCache]: Analyzing trace with hash 152549995, now seen corresponding path program 1 times [2019-12-07 11:38:36,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:36,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509391298] [2019-12-07 11:38:36,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:36,844 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 11:38:36,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509391298] [2019-12-07 11:38:36,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:36,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:38:36,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535125742] [2019-12-07 11:38:36,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:36,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:36,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:36,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:36,845 INFO L87 Difference]: Start difference. First operand 10016 states and 30678 transitions. Second operand 4 states. [2019-12-07 11:38:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:36,870 INFO L93 Difference]: Finished difference Result 1976 states and 4671 transitions. [2019-12-07 11:38:36,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:38:36,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 11:38:36,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:36,873 INFO L225 Difference]: With dead ends: 1976 [2019-12-07 11:38:36,873 INFO L226 Difference]: Without dead ends: 1976 [2019-12-07 11:38:36,873 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 11:38:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2019-12-07 11:38:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1976. [2019-12-07 11:38:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-12-07 11:38:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4671 transitions. [2019-12-07 11:38:36,899 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4671 transitions. Word has length 20 [2019-12-07 11:38:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:36,899 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 4671 transitions. [2019-12-07 11:38:36,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4671 transitions. [2019-12-07 11:38:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:38:36,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:36,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:36,902 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:36,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1752215634, now seen corresponding path program 1 times [2019-12-07 11:38:36,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:36,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704678646] [2019-12-07 11:38:36,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:36,929 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 11:38:36,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704678646] [2019-12-07 11:38:36,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:36,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:38:36,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66786871] [2019-12-07 11:38:36,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:36,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:36,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:36,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:36,931 INFO L87 Difference]: Start difference. First operand 1976 states and 4671 transitions. Second operand 3 states. [2019-12-07 11:38:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:36,971 INFO L93 Difference]: Finished difference Result 2799 states and 6499 transitions. [2019-12-07 11:38:36,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:36,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 11:38:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:36,975 INFO L225 Difference]: With dead ends: 2799 [2019-12-07 11:38:36,975 INFO L226 Difference]: Without dead ends: 2799 [2019-12-07 11:38:36,975 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 11:38:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-07 11:38:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2059. [2019-12-07 11:38:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-12-07 11:38:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 4847 transitions. [2019-12-07 11:38:37,006 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 4847 transitions. Word has length 29 [2019-12-07 11:38:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:37,006 INFO L462 AbstractCegarLoop]: Abstraction has 2059 states and 4847 transitions. [2019-12-07 11:38:37,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 4847 transitions. [2019-12-07 11:38:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:38:37,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:37,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:37,009 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1147773388, now seen corresponding path program 1 times [2019-12-07 11:38:37,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:37,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99343458] [2019-12-07 11:38:37,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:37,048 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 11:38:37,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99343458] [2019-12-07 11:38:37,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:37,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:38:37,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357712109] [2019-12-07 11:38:37,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:38:37,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:37,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:38:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:38:37,049 INFO L87 Difference]: Start difference. First operand 2059 states and 4847 transitions. Second operand 5 states. [2019-12-07 11:38:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:37,069 INFO L93 Difference]: Finished difference Result 1232 states and 2851 transitions. [2019-12-07 11:38:37,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:37,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 11:38:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:37,070 INFO L225 Difference]: With dead ends: 1232 [2019-12-07 11:38:37,070 INFO L226 Difference]: Without dead ends: 610 [2019-12-07 11:38:37,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:38:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-07 11:38:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-12-07 11:38:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-12-07 11:38:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1368 transitions. [2019-12-07 11:38:37,075 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1368 transitions. Word has length 29 [2019-12-07 11:38:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:37,076 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 1368 transitions. [2019-12-07 11:38:37,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:38:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1368 transitions. [2019-12-07 11:38:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:38:37,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:37,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:37,077 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:37,077 INFO L82 PathProgramCache]: Analyzing trace with hash 965332247, now seen corresponding path program 1 times [2019-12-07 11:38:37,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:37,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226269041] [2019-12-07 11:38:37,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:37,294 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 11:38:37,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226269041] [2019-12-07 11:38:37,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:37,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:38:37,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281212711] [2019-12-07 11:38:37,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:38:37,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:37,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:38:37,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:38:37,296 INFO L87 Difference]: Start difference. First operand 610 states and 1368 transitions. Second operand 12 states. [2019-12-07 11:38:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:39,225 INFO L93 Difference]: Finished difference Result 2026 states and 4355 transitions. [2019-12-07 11:38:39,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 11:38:39,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-12-07 11:38:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:39,227 INFO L225 Difference]: With dead ends: 2026 [2019-12-07 11:38:39,227 INFO L226 Difference]: Without dead ends: 1093 [2019-12-07 11:38:39,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:38:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2019-12-07 11:38:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 689. [2019-12-07 11:38:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-07 11:38:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1546 transitions. [2019-12-07 11:38:39,234 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1546 transitions. Word has length 45 [2019-12-07 11:38:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:39,234 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1546 transitions. [2019-12-07 11:38:39,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:38:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1546 transitions. [2019-12-07 11:38:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:38:39,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:39,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:39,235 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:39,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:39,235 INFO L82 PathProgramCache]: Analyzing trace with hash 711088023, now seen corresponding path program 2 times [2019-12-07 11:38:39,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:39,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295845130] [2019-12-07 11:38:39,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:39,311 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 11:38:39,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295845130] [2019-12-07 11:38:39,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:39,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:38:39,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610502115] [2019-12-07 11:38:39,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:38:39,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:39,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:38:39,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:38:39,313 INFO L87 Difference]: Start difference. First operand 689 states and 1546 transitions. Second operand 7 states. [2019-12-07 11:38:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:39,495 INFO L93 Difference]: Finished difference Result 1554 states and 3367 transitions. [2019-12-07 11:38:39,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:38:39,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 11:38:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:39,496 INFO L225 Difference]: With dead ends: 1554 [2019-12-07 11:38:39,496 INFO L226 Difference]: Without dead ends: 1124 [2019-12-07 11:38:39,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:38:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2019-12-07 11:38:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 694. [2019-12-07 11:38:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-07 11:38:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1552 transitions. [2019-12-07 11:38:39,503 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1552 transitions. Word has length 45 [2019-12-07 11:38:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:39,503 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1552 transitions. [2019-12-07 11:38:39,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:38:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1552 transitions. [2019-12-07 11:38:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:38:39,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:39,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:39,504 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:39,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1361037591, now seen corresponding path program 3 times [2019-12-07 11:38:39,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:39,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143894363] [2019-12-07 11:38:39,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:38:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:38:39,594 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:38:39,594 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:38:39,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= v_~x~0_45 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_31|) |v_ULTIMATE.start_main_~#t1394~0.offset_23| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_16 0) (= 0 v_~y$r_buff1_thd1~0_88) (= (store .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_31| 1) |v_#valid_62|) (= |v_ULTIMATE.start_main_~#t1394~0.offset_23| 0) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_31|)) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1394~0.base_31|) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1394~0.base_31| 4)) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_~#t1394~0.base=|v_ULTIMATE.start_main_~#t1394~0.base_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_12, ULTIMATE.start_main_~#t1394~0.offset=|v_ULTIMATE.start_main_~#t1394~0.offset_23|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_29|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_15|, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1395~0.base, ULTIMATE.start_main_~#t1396~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1396~0.offset, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1394~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1395~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1394~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:38:39,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1395~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9|) |v_ULTIMATE.start_main_~#t1395~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1395~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1395~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1395~0.base_9| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_9|, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1395~0.offset, ULTIMATE.start_main_~#t1395~0.base] because there is no mapped edge [2019-12-07 11:38:39,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1396~0.offset_9| 0) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1396~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10|) |v_ULTIMATE.start_main_~#t1396~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1396~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1396~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1396~0.offset] because there is no mapped edge [2019-12-07 11:38:39,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:38:39,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:38:39,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1015600867 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1015600867 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1015600867 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In1015600867 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1015600867 256)))) .cse1 (= ~y$w_buff0~0_In1015600867 |P1Thread1of1ForFork1_#t~ite8_Out1015600867|) (= |P1Thread1of1ForFork1_#t~ite9_Out1015600867| |P1Thread1of1ForFork1_#t~ite8_Out1015600867|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out1015600867| ~y$w_buff0~0_In1015600867) (= |P1Thread1of1ForFork1_#t~ite8_In1015600867| |P1Thread1of1ForFork1_#t~ite8_Out1015600867|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1015600867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1015600867, ~y$w_buff0~0=~y$w_buff0~0_In1015600867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1015600867, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1015600867|, ~weak$$choice2~0=~weak$$choice2~0_In1015600867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1015600867} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1015600867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1015600867, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1015600867|, ~y$w_buff0~0=~y$w_buff0~0_In1015600867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1015600867, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1015600867|, ~weak$$choice2~0=~weak$$choice2~0_In1015600867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1015600867} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:38:39,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In461459620 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out461459620| ~y$w_buff1~0_In461459620) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_In461459620| |P1Thread1of1ForFork1_#t~ite11_Out461459620|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out461459620| |P1Thread1of1ForFork1_#t~ite11_Out461459620|) (= |P1Thread1of1ForFork1_#t~ite11_Out461459620| ~y$w_buff1~0_In461459620) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In461459620 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In461459620 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In461459620 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In461459620 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In461459620, ~y$w_buff1~0=~y$w_buff1~0_In461459620, ~y$w_buff0_used~0=~y$w_buff0_used~0_In461459620, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In461459620, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In461459620|, ~weak$$choice2~0=~weak$$choice2~0_In461459620, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461459620} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In461459620, ~y$w_buff1~0=~y$w_buff1~0_In461459620, ~y$w_buff0_used~0=~y$w_buff0_used~0_In461459620, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In461459620, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out461459620|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out461459620|, ~weak$$choice2~0=~weak$$choice2~0_In461459620, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461459620} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 11:38:39,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:38:39,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:38:39,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1358523034 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1358523034 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1358523034| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1358523034 |P2Thread1of1ForFork2_#t~ite28_Out1358523034|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1358523034, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1358523034} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1358523034, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1358523034, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1358523034|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:38:39,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-342358282 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-342358282 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-342358282 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-342358282 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-342358282| ~y$w_buff1_used~0_In-342358282) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite29_Out-342358282| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-342358282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-342358282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-342358282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-342358282} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-342358282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-342358282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-342358282, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-342358282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-342358282} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:38:39,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1542349819 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1542349819 256) 0)) (.cse0 (= ~y$r_buff0_thd3~0_In-1542349819 ~y$r_buff0_thd3~0_Out-1542349819))) (or (and .cse0 .cse1) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-1542349819 0) (not .cse2)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1542349819, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1542349819} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1542349819, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1542349819|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1542349819} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:38:39,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In825143267 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In825143267 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In825143267 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In825143267 256)))) (or (and (= ~y$r_buff1_thd3~0_In825143267 |P2Thread1of1ForFork2_#t~ite31_Out825143267|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out825143267|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In825143267, ~y$w_buff0_used~0=~y$w_buff0_used~0_In825143267, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In825143267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In825143267} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In825143267, ~y$w_buff0_used~0=~y$w_buff0_used~0_In825143267, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out825143267|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In825143267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In825143267} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 11:38:39,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:38:39,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:38:39,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1373951074 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1373951074 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1373951074| ~y~0_In1373951074)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1373951074| ~y$w_buff1~0_In1373951074)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1373951074, ~y~0=~y~0_In1373951074, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1373951074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1373951074} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1373951074, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1373951074|, ~y~0=~y~0_In1373951074, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1373951074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1373951074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 11:38:39,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 11:38:39,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-436616874 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-436616874 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-436616874|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-436616874 |ULTIMATE.start_main_#t~ite37_Out-436616874|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-436616874, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-436616874} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-436616874, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-436616874, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-436616874|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:38:39,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-835669405 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-835669405 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-835669405 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-835669405 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-835669405| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite38_Out-835669405| ~y$w_buff1_used~0_In-835669405)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-835669405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-835669405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-835669405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835669405} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-835669405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-835669405, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-835669405|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-835669405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835669405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:38:39,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In177325727 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In177325727 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out177325727| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out177325727| ~y$r_buff0_thd0~0_In177325727) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In177325727, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In177325727} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In177325727, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out177325727|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In177325727} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:38:39,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1305584910 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1305584910 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1305584910 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1305584910 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1305584910| ~y$r_buff1_thd0~0_In-1305584910) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite40_Out-1305584910| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1305584910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1305584910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305584910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305584910} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1305584910|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1305584910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1305584910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305584910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305584910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:38:39,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:38:39,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:38:39 BasicIcfg [2019-12-07 11:38:39,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:38:39,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:38:39,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:38:39,664 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:38:39,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:38:28" (3/4) ... [2019-12-07 11:38:39,667 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:38:39,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= v_~x~0_45 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_31|) |v_ULTIMATE.start_main_~#t1394~0.offset_23| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_16 0) (= 0 v_~y$r_buff1_thd1~0_88) (= (store .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_31| 1) |v_#valid_62|) (= |v_ULTIMATE.start_main_~#t1394~0.offset_23| 0) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_31|)) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1394~0.base_31|) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1394~0.base_31| 4)) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_~#t1394~0.base=|v_ULTIMATE.start_main_~#t1394~0.base_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_12, ULTIMATE.start_main_~#t1394~0.offset=|v_ULTIMATE.start_main_~#t1394~0.offset_23|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_29|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_15|, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1395~0.base, ULTIMATE.start_main_~#t1396~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1396~0.offset, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1394~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1395~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1394~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:38:39,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1395~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9|) |v_ULTIMATE.start_main_~#t1395~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1395~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1395~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1395~0.base_9| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_9|, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1395~0.offset, ULTIMATE.start_main_~#t1395~0.base] because there is no mapped edge [2019-12-07 11:38:39,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1396~0.offset_9| 0) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1396~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10|) |v_ULTIMATE.start_main_~#t1396~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1396~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1396~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1396~0.offset] because there is no mapped edge [2019-12-07 11:38:39,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:38:39,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:38:39,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1015600867 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1015600867 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1015600867 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In1015600867 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1015600867 256)))) .cse1 (= ~y$w_buff0~0_In1015600867 |P1Thread1of1ForFork1_#t~ite8_Out1015600867|) (= |P1Thread1of1ForFork1_#t~ite9_Out1015600867| |P1Thread1of1ForFork1_#t~ite8_Out1015600867|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out1015600867| ~y$w_buff0~0_In1015600867) (= |P1Thread1of1ForFork1_#t~ite8_In1015600867| |P1Thread1of1ForFork1_#t~ite8_Out1015600867|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1015600867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1015600867, ~y$w_buff0~0=~y$w_buff0~0_In1015600867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1015600867, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1015600867|, ~weak$$choice2~0=~weak$$choice2~0_In1015600867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1015600867} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1015600867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1015600867, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1015600867|, ~y$w_buff0~0=~y$w_buff0~0_In1015600867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1015600867, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1015600867|, ~weak$$choice2~0=~weak$$choice2~0_In1015600867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1015600867} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:38:39,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In461459620 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out461459620| ~y$w_buff1~0_In461459620) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_In461459620| |P1Thread1of1ForFork1_#t~ite11_Out461459620|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out461459620| |P1Thread1of1ForFork1_#t~ite11_Out461459620|) (= |P1Thread1of1ForFork1_#t~ite11_Out461459620| ~y$w_buff1~0_In461459620) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In461459620 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In461459620 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In461459620 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In461459620 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In461459620, ~y$w_buff1~0=~y$w_buff1~0_In461459620, ~y$w_buff0_used~0=~y$w_buff0_used~0_In461459620, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In461459620, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In461459620|, ~weak$$choice2~0=~weak$$choice2~0_In461459620, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461459620} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In461459620, ~y$w_buff1~0=~y$w_buff1~0_In461459620, ~y$w_buff0_used~0=~y$w_buff0_used~0_In461459620, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In461459620, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out461459620|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out461459620|, ~weak$$choice2~0=~weak$$choice2~0_In461459620, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461459620} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 11:38:39,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:38:39,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:38:39,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1358523034 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1358523034 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1358523034| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1358523034 |P2Thread1of1ForFork2_#t~ite28_Out1358523034|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1358523034, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1358523034} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1358523034, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1358523034, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1358523034|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:38:39,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-342358282 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-342358282 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-342358282 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-342358282 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-342358282| ~y$w_buff1_used~0_In-342358282) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite29_Out-342358282| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-342358282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-342358282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-342358282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-342358282} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-342358282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-342358282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-342358282, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-342358282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-342358282} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:38:39,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1542349819 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1542349819 256) 0)) (.cse0 (= ~y$r_buff0_thd3~0_In-1542349819 ~y$r_buff0_thd3~0_Out-1542349819))) (or (and .cse0 .cse1) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-1542349819 0) (not .cse2)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1542349819, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1542349819} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1542349819, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1542349819|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1542349819} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:38:39,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In825143267 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In825143267 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In825143267 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In825143267 256)))) (or (and (= ~y$r_buff1_thd3~0_In825143267 |P2Thread1of1ForFork2_#t~ite31_Out825143267|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out825143267|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In825143267, ~y$w_buff0_used~0=~y$w_buff0_used~0_In825143267, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In825143267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In825143267} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In825143267, ~y$w_buff0_used~0=~y$w_buff0_used~0_In825143267, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out825143267|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In825143267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In825143267} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 11:38:39,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:38:39,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:38:39,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1373951074 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1373951074 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1373951074| ~y~0_In1373951074)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1373951074| ~y$w_buff1~0_In1373951074)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1373951074, ~y~0=~y~0_In1373951074, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1373951074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1373951074} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1373951074, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1373951074|, ~y~0=~y~0_In1373951074, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1373951074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1373951074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 11:38:39,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 11:38:39,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-436616874 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-436616874 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-436616874|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-436616874 |ULTIMATE.start_main_#t~ite37_Out-436616874|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-436616874, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-436616874} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-436616874, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-436616874, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-436616874|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:38:39,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-835669405 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-835669405 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-835669405 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-835669405 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-835669405| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite38_Out-835669405| ~y$w_buff1_used~0_In-835669405)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-835669405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-835669405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-835669405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835669405} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-835669405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-835669405, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-835669405|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-835669405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835669405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:38:39,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In177325727 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In177325727 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out177325727| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out177325727| ~y$r_buff0_thd0~0_In177325727) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In177325727, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In177325727} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In177325727, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out177325727|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In177325727} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:38:39,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1305584910 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1305584910 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1305584910 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1305584910 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1305584910| ~y$r_buff1_thd0~0_In-1305584910) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite40_Out-1305584910| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1305584910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1305584910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305584910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305584910} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1305584910|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1305584910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1305584910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305584910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305584910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:38:39,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:38:39,732 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_51228905-9cc3-4a85-8081-da2f9afd078f/bin/uautomizer/witness.graphml [2019-12-07 11:38:39,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:38:39,733 INFO L168 Benchmark]: Toolchain (without parser) took 11789.99 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 769.1 MB). Free memory was 939.4 MB in the beginning and 929.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 778.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:39,734 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:38:39,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -121.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:39,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:39,735 INFO L168 Benchmark]: Boogie Preprocessor took 26.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:38:39,735 INFO L168 Benchmark]: RCFGBuilder took 377.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:39,736 INFO L168 Benchmark]: TraceAbstraction took 10907.18 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 674.8 MB). Free memory was 1.0 GB in the beginning and 952.1 MB in the end (delta: 52.6 MB). Peak memory consumption was 727.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:39,736 INFO L168 Benchmark]: Witness Printer took 67.92 ms. Allocated memory is still 1.8 GB. Free memory was 952.1 MB in the beginning and 929.6 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:38:39,739 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -121.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10907.18 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 674.8 MB). Free memory was 1.0 GB in the beginning and 952.1 MB in the end (delta: 52.6 MB). Peak memory consumption was 727.4 MB. Max. memory is 11.5 GB. * Witness Printer took 67.92 ms. Allocated memory is still 1.8 GB. Free memory was 952.1 MB in the beginning and 929.6 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 151 ProgramPointsBefore, 72 ProgramPointsAfterwards, 176 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 21 ChoiceCompositions, 5098 VarBasedMoverChecksPositive, 188 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 154 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 39870 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 1 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 2 x = 2 [L747] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 2 y$flush_delayed = weak$$choice2 [L750] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L752] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L753] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L754] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L755] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1603 SDtfs, 1428 SDslu, 3505 SDs, 0 SdLazy, 2624 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18074occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 10948 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 40321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...