/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:02:16,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:02:16,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:02:16,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:02:16,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:02:16,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:02:16,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:02:16,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:02:16,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:02:16,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:02:16,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:02:16,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:02:16,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:02:16,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:02:16,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:02:16,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:02:16,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:02:16,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:02:16,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:02:16,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:02:16,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:02:16,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:02:16,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:02:16,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:02:16,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:02:16,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:02:16,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:02:16,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:02:16,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:02:16,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:02:16,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:02:16,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:02:16,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:02:16,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:02:16,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:02:16,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:02:16,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:02:16,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:02:16,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:02:16,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:02:16,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:02:16,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:02:16,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:02:16,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:02:16,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:02:16,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:02:16,254 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:02:16,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:02:16,254 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:02:16,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:02:16,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:02:16,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:02:16,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:02:16,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:02:16,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:02:16,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:02:16,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:02:16,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:02:16,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:02:16,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:02:16,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:02:16,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:02:16,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:02:16,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:02:16,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:02:16,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:02:16,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:02:16,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:02:16,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:02:16,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:02:16,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:02:16,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:02:16,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:02:16,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:02:16,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:02:16,547 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:02:16,547 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-18 18:02:16,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995b02c8d/0ac400dc229045ceb41d1ba450fcc7f7/FLAGd0156f595 [2019-12-18 18:02:17,207 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:02:17,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-18 18:02:17,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995b02c8d/0ac400dc229045ceb41d1ba450fcc7f7/FLAGd0156f595 [2019-12-18 18:02:17,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995b02c8d/0ac400dc229045ceb41d1ba450fcc7f7 [2019-12-18 18:02:17,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:02:17,536 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:02:17,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:17,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:02:17,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:02:17,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:17" (1/1) ... [2019-12-18 18:02:17,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2908c1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:17, skipping insertion in model container [2019-12-18 18:02:17,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:17" (1/1) ... [2019-12-18 18:02:17,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:02:17,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:02:18,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:18,183 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:02:18,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:18,339 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:02:18,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18 WrapperNode [2019-12-18 18:02:18,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:18,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:18,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:02:18,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:02:18,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... [2019-12-18 18:02:18,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... [2019-12-18 18:02:18,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:18,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:02:18,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:02:18,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:02:18,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... [2019-12-18 18:02:18,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... [2019-12-18 18:02:18,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... [2019-12-18 18:02:18,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... [2019-12-18 18:02:18,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... [2019-12-18 18:02:18,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... [2019-12-18 18:02:18,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... [2019-12-18 18:02:18,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:02:18,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:02:18,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:02:18,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:02:18,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-18 18:02:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:02:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:02:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:02:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:02:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:02:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:02:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:02:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:02:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:02:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:02:18,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:02:18,540 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:02:19,241 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:02:19,241 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:02:19,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:19 BoogieIcfgContainer [2019-12-18 18:02:19,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:02:19,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:02:19,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:02:19,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:02:19,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:02:17" (1/3) ... [2019-12-18 18:02:19,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5a61b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:19, skipping insertion in model container [2019-12-18 18:02:19,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:18" (2/3) ... [2019-12-18 18:02:19,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5a61b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:19, skipping insertion in model container [2019-12-18 18:02:19,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:19" (3/3) ... [2019-12-18 18:02:19,252 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt.i [2019-12-18 18:02:19,263 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:02:19,263 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:02:19,272 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:02:19,273 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:02:19,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,307 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,307 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,330 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,331 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,333 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:19,354 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:02:19,388 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:02:19,388 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:02:19,389 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:02:19,389 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:02:19,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:02:19,389 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:02:19,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:02:19,389 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:02:19,414 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 18:02:19,416 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 18:02:19,513 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 18:02:19,513 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:19,533 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:02:19,552 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 18:02:19,608 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 18:02:19,608 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:19,613 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:02:19,625 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 18:02:19,626 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:02:24,042 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 18:02:24,153 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 18:02:24,187 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46553 [2019-12-18 18:02:24,187 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 18:02:24,191 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 18:02:24,602 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-18 18:02:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-18 18:02:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:02:24,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:24,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:02:24,613 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash 698534967, now seen corresponding path program 1 times [2019-12-18 18:02:24,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:24,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108773023] [2019-12-18 18:02:24,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:24,840 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-18 18:02:24,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108773023] [2019-12-18 18:02:24,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:24,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:02:24,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802474849] [2019-12-18 18:02:24,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:02:24,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:24,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:02:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:02:24,869 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-18 18:02:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:25,177 INFO L93 Difference]: Finished difference Result 8365 states and 27377 transitions. [2019-12-18 18:02:25,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:02:25,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:02:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:25,275 INFO L225 Difference]: With dead ends: 8365 [2019-12-18 18:02:25,276 INFO L226 Difference]: Without dead ends: 8196 [2019-12-18 18:02:25,277 INFO L631 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-18 18:02:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8196 states. [2019-12-18 18:02:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8196 to 8196. [2019-12-18 18:02:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-18 18:02:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 26857 transitions. [2019-12-18 18:02:25,756 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 26857 transitions. Word has length 5 [2019-12-18 18:02:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:25,756 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 26857 transitions. [2019-12-18 18:02:25,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:02:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 26857 transitions. [2019-12-18 18:02:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:02:25,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:25,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:25,762 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1108629868, now seen corresponding path program 1 times [2019-12-18 18:02:25,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:25,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221127685] [2019-12-18 18:02:25,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:25,931 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-18 18:02:25,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221127685] [2019-12-18 18:02:25,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:25,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:02:25,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045190980] [2019-12-18 18:02:25,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:02:25,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:02:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:02:25,935 INFO L87 Difference]: Start difference. First operand 8196 states and 26857 transitions. Second operand 4 states. [2019-12-18 18:02:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:26,402 INFO L93 Difference]: Finished difference Result 13084 states and 41046 transitions. [2019-12-18 18:02:26,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:02:26,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:02:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:26,515 INFO L225 Difference]: With dead ends: 13084 [2019-12-18 18:02:26,516 INFO L226 Difference]: Without dead ends: 13077 [2019-12-18 18:02:26,520 INFO L631 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-18 18:02:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13077 states. [2019-12-18 18:02:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13077 to 11568. [2019-12-18 18:02:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11568 states. [2019-12-18 18:02:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 36838 transitions. [2019-12-18 18:02:27,536 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 36838 transitions. Word has length 11 [2019-12-18 18:02:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:27,537 INFO L462 AbstractCegarLoop]: Abstraction has 11568 states and 36838 transitions. [2019-12-18 18:02:27,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:02:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 36838 transitions. [2019-12-18 18:02:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:02:27,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:27,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:27,546 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:27,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:27,546 INFO L82 PathProgramCache]: Analyzing trace with hash 531606898, now seen corresponding path program 1 times [2019-12-18 18:02:27,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:27,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735353232] [2019-12-18 18:02:27,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:27,609 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-18 18:02:27,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735353232] [2019-12-18 18:02:27,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:27,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:02:27,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178285322] [2019-12-18 18:02:27,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:02:27,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:27,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:02:27,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:02:27,611 INFO L87 Difference]: Start difference. First operand 11568 states and 36838 transitions. Second operand 4 states. [2019-12-18 18:02:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:27,850 INFO L93 Difference]: Finished difference Result 14627 states and 46118 transitions. [2019-12-18 18:02:27,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:02:27,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:02:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:27,901 INFO L225 Difference]: With dead ends: 14627 [2019-12-18 18:02:27,901 INFO L226 Difference]: Without dead ends: 14627 [2019-12-18 18:02:27,902 INFO L631 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-18 18:02:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14627 states. [2019-12-18 18:02:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14627 to 12851. [2019-12-18 18:02:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12851 states. [2019-12-18 18:02:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12851 states to 12851 states and 40863 transitions. [2019-12-18 18:02:28,430 INFO L78 Accepts]: Start accepts. Automaton has 12851 states and 40863 transitions. Word has length 11 [2019-12-18 18:02:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:28,430 INFO L462 AbstractCegarLoop]: Abstraction has 12851 states and 40863 transitions. [2019-12-18 18:02:28,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:02:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 12851 states and 40863 transitions. [2019-12-18 18:02:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 18:02:28,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:28,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:28,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:28,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:28,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1151367975, now seen corresponding path program 1 times [2019-12-18 18:02:28,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:28,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659853440] [2019-12-18 18:02:28,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:28,515 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-18 18:02:28,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659853440] [2019-12-18 18:02:28,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:28,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:02:28,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340526975] [2019-12-18 18:02:28,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:02:28,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:28,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:02:28,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:02:28,518 INFO L87 Difference]: Start difference. First operand 12851 states and 40863 transitions. Second operand 5 states. [2019-12-18 18:02:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:28,959 INFO L93 Difference]: Finished difference Result 17501 states and 54434 transitions. [2019-12-18 18:02:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:02:28,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 18:02:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:29,057 INFO L225 Difference]: With dead ends: 17501 [2019-12-18 18:02:29,057 INFO L226 Difference]: Without dead ends: 17494 [2019-12-18 18:02:29,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:02:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17494 states. [2019-12-18 18:02:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17494 to 12893. [2019-12-18 18:02:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12893 states. [2019-12-18 18:02:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12893 states to 12893 states and 40855 transitions. [2019-12-18 18:02:29,688 INFO L78 Accepts]: Start accepts. Automaton has 12893 states and 40855 transitions. Word has length 17 [2019-12-18 18:02:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:29,688 INFO L462 AbstractCegarLoop]: Abstraction has 12893 states and 40855 transitions. [2019-12-18 18:02:29,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:02:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 12893 states and 40855 transitions. [2019-12-18 18:02:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:02:29,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:29,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:29,702 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:29,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2101636237, now seen corresponding path program 1 times [2019-12-18 18:02:29,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:29,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746038286] [2019-12-18 18:02:29,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:29,758 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-18 18:02:29,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746038286] [2019-12-18 18:02:29,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:29,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:02:29,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526302855] [2019-12-18 18:02:29,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:02:29,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:29,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:02:29,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:02:29,760 INFO L87 Difference]: Start difference. First operand 12893 states and 40855 transitions. Second operand 3 states. [2019-12-18 18:02:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:29,866 INFO L93 Difference]: Finished difference Result 15714 states and 49940 transitions. [2019-12-18 18:02:29,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:02:29,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 18:02:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:29,902 INFO L225 Difference]: With dead ends: 15714 [2019-12-18 18:02:29,902 INFO L226 Difference]: Without dead ends: 15714 [2019-12-18 18:02:29,902 INFO L631 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-18 18:02:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15714 states. [2019-12-18 18:02:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15714 to 14811. [2019-12-18 18:02:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14811 states. [2019-12-18 18:02:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14811 states to 14811 states and 47249 transitions. [2019-12-18 18:02:30,928 INFO L78 Accepts]: Start accepts. Automaton has 14811 states and 47249 transitions. Word has length 25 [2019-12-18 18:02:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:30,932 INFO L462 AbstractCegarLoop]: Abstraction has 14811 states and 47249 transitions. [2019-12-18 18:02:30,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:02:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 14811 states and 47249 transitions. [2019-12-18 18:02:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:02:30,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:30,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:30,955 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:30,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1939096541, now seen corresponding path program 1 times [2019-12-18 18:02:30,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:30,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912376230] [2019-12-18 18:02:30,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:31,050 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-18 18:02:31,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912376230] [2019-12-18 18:02:31,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:31,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:02:31,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427172524] [2019-12-18 18:02:31,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:02:31,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:31,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:02:31,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:02:31,053 INFO L87 Difference]: Start difference. First operand 14811 states and 47249 transitions. Second operand 4 states. [2019-12-18 18:02:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:31,084 INFO L93 Difference]: Finished difference Result 2380 states and 5507 transitions. [2019-12-18 18:02:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:02:31,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:02:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:31,089 INFO L225 Difference]: With dead ends: 2380 [2019-12-18 18:02:31,089 INFO L226 Difference]: Without dead ends: 2094 [2019-12-18 18:02:31,090 INFO L631 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-18 18:02:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2019-12-18 18:02:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2019-12-18 18:02:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-12-18 18:02:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4716 transitions. [2019-12-18 18:02:31,127 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 4716 transitions. Word has length 25 [2019-12-18 18:02:31,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:31,127 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 4716 transitions. [2019-12-18 18:02:31,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:02:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 4716 transitions. [2019-12-18 18:02:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:02:31,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:31,131 INFO L411 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] [2019-12-18 18:02:31,131 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash -673430796, now seen corresponding path program 1 times [2019-12-18 18:02:31,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:31,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734187007] [2019-12-18 18:02:31,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:31,273 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-18 18:02:31,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734187007] [2019-12-18 18:02:31,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:31,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:02:31,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814221783] [2019-12-18 18:02:31,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:02:31,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:31,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:02:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:02:31,276 INFO L87 Difference]: Start difference. First operand 2094 states and 4716 transitions. Second operand 5 states. [2019-12-18 18:02:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:31,315 INFO L93 Difference]: Finished difference Result 429 states and 783 transitions. [2019-12-18 18:02:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:02:31,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:02:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:31,317 INFO L225 Difference]: With dead ends: 429 [2019-12-18 18:02:31,317 INFO L226 Difference]: Without dead ends: 383 [2019-12-18 18:02:31,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:02:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-18 18:02:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 348. [2019-12-18 18:02:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-18 18:02:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 628 transitions. [2019-12-18 18:02:31,324 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 628 transitions. Word has length 37 [2019-12-18 18:02:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:31,324 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 628 transitions. [2019-12-18 18:02:31,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:02:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 628 transitions. [2019-12-18 18:02:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:02:31,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:31,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:31,327 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:31,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash 939573543, now seen corresponding path program 1 times [2019-12-18 18:02:31,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:31,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697683751] [2019-12-18 18:02:31,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:31,406 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-18 18:02:31,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697683751] [2019-12-18 18:02:31,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:31,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:02:31,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739926512] [2019-12-18 18:02:31,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:02:31,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:31,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:02:31,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:02:31,409 INFO L87 Difference]: Start difference. First operand 348 states and 628 transitions. Second operand 3 states. [2019-12-18 18:02:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:31,447 INFO L93 Difference]: Finished difference Result 352 states and 622 transitions. [2019-12-18 18:02:31,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:02:31,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:02:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:31,449 INFO L225 Difference]: With dead ends: 352 [2019-12-18 18:02:31,449 INFO L226 Difference]: Without dead ends: 352 [2019-12-18 18:02:31,450 INFO L631 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-18 18:02:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-18 18:02:31,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2019-12-18 18:02:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 18:02:31,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 614 transitions. [2019-12-18 18:02:31,456 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 614 transitions. Word has length 52 [2019-12-18 18:02:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:31,456 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 614 transitions. [2019-12-18 18:02:31,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:02:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 614 transitions. [2019-12-18 18:02:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:02:31,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:31,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:31,459 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:31,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:31,459 INFO L82 PathProgramCache]: Analyzing trace with hash 933754688, now seen corresponding path program 1 times [2019-12-18 18:02:31,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:31,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146622921] [2019-12-18 18:02:31,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:31,538 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-18 18:02:31,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146622921] [2019-12-18 18:02:31,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:31,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:02:31,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486334304] [2019-12-18 18:02:31,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:02:31,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:31,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:02:31,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:02:31,543 INFO L87 Difference]: Start difference. First operand 344 states and 614 transitions. Second operand 3 states. [2019-12-18 18:02:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:31,556 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2019-12-18 18:02:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:02:31,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:02:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:31,557 INFO L225 Difference]: With dead ends: 344 [2019-12-18 18:02:31,557 INFO L226 Difference]: Without dead ends: 344 [2019-12-18 18:02:31,558 INFO L631 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-18 18:02:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-18 18:02:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-12-18 18:02:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 18:02:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 601 transitions. [2019-12-18 18:02:31,564 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 601 transitions. Word has length 52 [2019-12-18 18:02:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:31,564 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 601 transitions. [2019-12-18 18:02:31,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:02:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 601 transitions. [2019-12-18 18:02:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:02:31,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:31,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:31,567 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:31,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1595558797, now seen corresponding path program 1 times [2019-12-18 18:02:31,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:31,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899796867] [2019-12-18 18:02:31,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:31,937 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-18 18:02:31,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899796867] [2019-12-18 18:02:31,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:31,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:02:31,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417498947] [2019-12-18 18:02:31,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:02:31,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:02:31,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:02:31,939 INFO L87 Difference]: Start difference. First operand 344 states and 601 transitions. Second operand 9 states. [2019-12-18 18:02:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:32,473 INFO L93 Difference]: Finished difference Result 582 states and 1009 transitions. [2019-12-18 18:02:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:02:32,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 18:02:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:32,475 INFO L225 Difference]: With dead ends: 582 [2019-12-18 18:02:32,475 INFO L226 Difference]: Without dead ends: 582 [2019-12-18 18:02:32,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:02:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-12-18 18:02:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 432. [2019-12-18 18:02:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-12-18 18:02:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 756 transitions. [2019-12-18 18:02:32,483 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 756 transitions. Word has length 53 [2019-12-18 18:02:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:32,483 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 756 transitions. [2019-12-18 18:02:32,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:02:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 756 transitions. [2019-12-18 18:02:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:02:32,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:32,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:32,485 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:32,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:32,485 INFO L82 PathProgramCache]: Analyzing trace with hash 165214383, now seen corresponding path program 2 times [2019-12-18 18:02:32,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:32,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117439316] [2019-12-18 18:02:32,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:32,546 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-18 18:02:32,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117439316] [2019-12-18 18:02:32,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:32,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:02:32,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461701603] [2019-12-18 18:02:32,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:02:32,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:02:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:02:32,548 INFO L87 Difference]: Start difference. First operand 432 states and 756 transitions. Second operand 3 states. [2019-12-18 18:02:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:32,582 INFO L93 Difference]: Finished difference Result 431 states and 754 transitions. [2019-12-18 18:02:32,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:02:32,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:02:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:32,583 INFO L225 Difference]: With dead ends: 431 [2019-12-18 18:02:32,583 INFO L226 Difference]: Without dead ends: 431 [2019-12-18 18:02:32,584 INFO L631 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-18 18:02:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-18 18:02:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 343. [2019-12-18 18:02:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 18:02:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 590 transitions. [2019-12-18 18:02:32,589 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 590 transitions. Word has length 53 [2019-12-18 18:02:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:32,590 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 590 transitions. [2019-12-18 18:02:32,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:02:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 590 transitions. [2019-12-18 18:02:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:02:32,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:32,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:32,591 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:32,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash -798816837, now seen corresponding path program 1 times [2019-12-18 18:02:32,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:32,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171315699] [2019-12-18 18:02:32,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:32,771 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-18 18:02:32,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171315699] [2019-12-18 18:02:32,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:32,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:02:32,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334796146] [2019-12-18 18:02:32,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:02:32,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:02:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:02:32,773 INFO L87 Difference]: Start difference. First operand 343 states and 590 transitions. Second operand 7 states. [2019-12-18 18:02:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:32,874 INFO L93 Difference]: Finished difference Result 546 states and 939 transitions. [2019-12-18 18:02:32,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:02:32,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:02:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:32,876 INFO L225 Difference]: With dead ends: 546 [2019-12-18 18:02:32,876 INFO L226 Difference]: Without dead ends: 220 [2019-12-18 18:02:32,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:02:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-18 18:02:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-12-18 18:02:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-18 18:02:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 330 transitions. [2019-12-18 18:02:32,880 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 330 transitions. Word has length 54 [2019-12-18 18:02:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:32,880 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 330 transitions. [2019-12-18 18:02:32,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:02:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 330 transitions. [2019-12-18 18:02:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:02:32,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:32,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:02:32,881 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:32,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:32,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1731930561, now seen corresponding path program 2 times [2019-12-18 18:02:32,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:32,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784351006] [2019-12-18 18:02:32,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:02:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:02:32,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:02:32,975 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:02:32,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~z~0_122 0) (= v_~y$mem_tmp~0_21 0) (= v_~y$r_buff1_thd1~0_178 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1611~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1611~0.base_19|) |v_ULTIMATE.start_main_~#t1611~0.offset_14| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~weak$$choice2~0_120 0) (= v_~__unbuffered_p1_EAX~0_131 0) (= v_~y$r_buff0_thd0~0_347 0) (= 0 |v_ULTIMATE.start_main_~#t1611~0.offset_14|) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~x~0_94 0) (= 0 v_~weak$$choice0~0_15) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd2~0_225) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~__unbuffered_cnt~0_63) (= v_~y$r_buff0_thd1~0_109 0) (= v_~y$w_buff0_used~0_663 0) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t1611~0.base_19| 1)) (= v_~y$w_buff1~0_180 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1611~0.base_19| 4)) (= 0 v_~y$flush_delayed~0_36) (= |v_#NULL.offset_5| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1611~0.base_19|) (= v_~y~0_158 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd0~0_274 0) (= 0 v_~y$w_buff0~0_245) (= (select .cse0 |v_ULTIMATE.start_main_~#t1611~0.base_19|) 0) (= v_~main$tmp_guard1~0_25 0) (= v_~y$w_buff1_used~0_350 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1611~0.base=|v_ULTIMATE.start_main_~#t1611~0.base_19|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_33|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_131, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_28|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_46|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~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_225, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_274, ~x~0=v_~x~0_94, ~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_663, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_~#t1611~0.offset=|v_ULTIMATE.start_main_~#t1611~0.offset_14|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_44|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_42|, ~y$w_buff0~0=v_~y$w_buff0~0_245, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t1612~0.base=|v_ULTIMATE.start_main_~#t1612~0.base_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_31|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_~#t1612~0.offset=|v_ULTIMATE.start_main_~#t1612~0.offset_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_347, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_~#t1611~0.base, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1611~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1612~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1612~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:02:32,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L789-1-->L791: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1612~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1612~0.base_11|) |v_ULTIMATE.start_main_~#t1612~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1612~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1612~0.base_11| 1) |v_#valid_23|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1612~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1612~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1612~0.base_11|) (= |v_ULTIMATE.start_main_~#t1612~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1612~0.base=|v_ULTIMATE.start_main_~#t1612~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1612~0.offset=|v_ULTIMATE.start_main_~#t1612~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1612~0.base, ULTIMATE.start_main_~#t1612~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 18:02:32,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 1 v_~y$w_buff0_used~0_86) (= 2 v_~y$w_buff0~0_19) (= v_~y$w_buff0~0_20 v_~y$w_buff1~0_21) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_87)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff1~0=v_~y$w_buff1~0_21, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~y$w_buff0~0=v_~y$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:02:32,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In458847756 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In458847756 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out458847756| |P0Thread1of1ForFork0_#t~ite4_Out458847756|))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out458847756| ~y$w_buff1~0_In458847756) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out458847756| ~y~0_In458847756) (or .cse0 .cse1) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In458847756, ~y$w_buff1~0=~y$w_buff1~0_In458847756, ~y~0=~y~0_In458847756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In458847756} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In458847756, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out458847756|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out458847756|, ~y$w_buff1~0=~y$w_buff1~0_In458847756, ~y~0=~y~0_In458847756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In458847756} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 18:02:32,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In143143948 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In143143948 256) 0))) (or (and (= ~y$w_buff0_used~0_In143143948 |P0Thread1of1ForFork0_#t~ite5_Out143143948|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out143143948|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In143143948, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In143143948} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out143143948|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In143143948, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In143143948} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:02:32,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1812109390 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1812109390 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1812109390 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1812109390 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1812109390 |P0Thread1of1ForFork0_#t~ite6_Out1812109390|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out1812109390| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1812109390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1812109390, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1812109390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1812109390} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1812109390|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1812109390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1812109390, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1812109390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1812109390} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:02:32,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In242362671 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In242362671 256)))) (or (and (= ~y$r_buff0_thd1~0_In242362671 |P0Thread1of1ForFork0_#t~ite7_Out242362671|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out242362671|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In242362671, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In242362671} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In242362671, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out242362671|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In242362671} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:02:32,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-1881637170 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1881637170 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1881637170 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-1881637170 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1881637170| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1881637170| ~y$r_buff1_thd1~0_In-1881637170)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1881637170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1881637170, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1881637170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1881637170} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1881637170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1881637170, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1881637170|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1881637170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1881637170} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:02:32,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_125, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:02:32,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In469025553 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In469025553 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out469025553| ~y$w_buff0_used~0_In469025553) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out469025553| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In469025553, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In469025553} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In469025553, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In469025553, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out469025553|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:02:32,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1850123574 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1850123574 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1850123574 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1850123574 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1850123574|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1850123574 |P1Thread1of1ForFork1_#t~ite12_Out1850123574|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1850123574, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1850123574, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1850123574, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1850123574} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1850123574, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1850123574, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1850123574, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1850123574|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1850123574} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:02:32,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1200588447 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1200588447 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1200588447 ~y$r_buff0_thd2~0_Out-1200588447)) (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-1200588447) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200588447, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1200588447} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200588447, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1200588447, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1200588447|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:02:32,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1414356263 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1414356263 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1414356263 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1414356263 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1414356263| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-1414356263 |P1Thread1of1ForFork1_#t~ite14_Out-1414356263|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1414356263, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1414356263, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1414356263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1414356263} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1414356263, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1414356263, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1414356263, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1414356263|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1414356263} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:02:32,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_144 |v_P1Thread1of1ForFork1_#t~ite14_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_144, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:02:32,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_132 256)) (= 0 (mod v_~y$w_buff0_used~0_236 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:02:32,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1468814528 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1468814528 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out1468814528| ~y$w_buff1~0_In1468814528) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1468814528| ~y~0_In1468814528)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1468814528, ~y~0=~y~0_In1468814528, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1468814528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1468814528} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1468814528|, ~y$w_buff1~0=~y$w_buff1~0_In1468814528, ~y~0=~y~0_In1468814528, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1468814528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1468814528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 18:02:32,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_44 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 18:02:32,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1444145006 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1444145006 256)))) (or (and (= ~y$w_buff0_used~0_In1444145006 |ULTIMATE.start_main_#t~ite19_Out1444145006|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out1444145006| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1444145006, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1444145006} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1444145006, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1444145006|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1444145006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 18:02:32,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1205802168 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1205802168 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1205802168 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1205802168 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1205802168|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1205802168 |ULTIMATE.start_main_#t~ite20_Out-1205802168|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1205802168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1205802168, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1205802168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1205802168} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1205802168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1205802168, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1205802168|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1205802168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1205802168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 18:02:32,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In719275335 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In719275335 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out719275335| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out719275335| ~y$r_buff0_thd0~0_In719275335)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In719275335, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719275335} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In719275335, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719275335, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out719275335|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 18:02:32,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In732211040 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In732211040 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In732211040 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In732211040 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out732211040| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out732211040| ~y$r_buff1_thd0~0_In732211040) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In732211040, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In732211040, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In732211040, ~y$w_buff1_used~0=~y$w_buff1_used~0_In732211040} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In732211040, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In732211040, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In732211040, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out732211040|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In732211040} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 18:02:32,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1042039563 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1042039563 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1042039563 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1042039563 256))) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1042039563 256) 0)))) (= |ULTIMATE.start_main_#t~ite38_Out1042039563| |ULTIMATE.start_main_#t~ite37_Out1042039563|) (= ~y$w_buff1_used~0_In1042039563 |ULTIMATE.start_main_#t~ite37_Out1042039563|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_In1042039563| |ULTIMATE.start_main_#t~ite37_Out1042039563|) (= |ULTIMATE.start_main_#t~ite38_Out1042039563| ~y$w_buff1_used~0_In1042039563)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1042039563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1042039563, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1042039563|, ~weak$$choice2~0=~weak$$choice2~0_In1042039563, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1042039563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1042039563} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1042039563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1042039563, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1042039563|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1042039563|, ~weak$$choice2~0=~weak$$choice2~0_In1042039563, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1042039563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1042039563} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 18:02:32,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 18:02:32,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L816-->L819-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_16 256)) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= v_~y~0_114 v_~y$mem_tmp~0_17) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_18|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:02:32,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:02:33,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:02:33 BasicIcfg [2019-12-18 18:02:33,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:02:33,098 INFO L168 Benchmark]: Toolchain (without parser) took 15562.03 ms. Allocated memory was 147.3 MB in the beginning and 713.6 MB in the end (delta: 566.2 MB). Free memory was 103.9 MB in the beginning and 374.7 MB in the end (delta: -270.8 MB). Peak memory consumption was 295.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:33,100 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:02:33,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.74 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 103.5 MB in the beginning and 159.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:33,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.22 ms. Allocated memory is still 205.5 MB. Free memory was 159.8 MB in the beginning and 156.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:33,102 INFO L168 Benchmark]: Boogie Preprocessor took 40.46 ms. Allocated memory is still 205.5 MB. Free memory was 156.7 MB in the beginning and 154.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:33,106 INFO L168 Benchmark]: RCFGBuilder took 788.37 ms. Allocated memory is still 205.5 MB. Free memory was 154.8 MB in the beginning and 110.0 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:33,107 INFO L168 Benchmark]: TraceAbstraction took 13851.10 ms. Allocated memory was 205.5 MB in the beginning and 713.6 MB in the end (delta: 508.0 MB). Free memory was 110.0 MB in the beginning and 374.7 MB in the end (delta: -264.8 MB). Peak memory consumption was 243.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:33,117 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.46 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.74 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 103.5 MB in the beginning and 159.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.22 ms. Allocated memory is still 205.5 MB. Free memory was 159.8 MB in the beginning and 156.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.46 ms. Allocated memory is still 205.5 MB. Free memory was 156.7 MB in the beginning and 154.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 788.37 ms. Allocated memory is still 205.5 MB. Free memory was 154.8 MB in the beginning and 110.0 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13851.10 ms. Allocated memory was 205.5 MB in the beginning and 713.6 MB in the end (delta: 508.0 MB). Free memory was 110.0 MB in the beginning and 374.7 MB in the end (delta: -264.8 MB). Peak memory consumption was 243.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 148 ProgramPointsBefore, 78 ProgramPointsAfterwards, 182 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3838 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 62 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46553 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1611, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L791] FCALL, FORK 0 pthread_create(&t1612, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1262 SDtfs, 1131 SDslu, 1960 SDs, 0 SdLazy, 1130 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14811occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 9094 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 449 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 49626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...