/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/mix025_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:51:46,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:51:46,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:51:46,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:51:46,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:51:46,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:51:46,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:51:46,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:51:46,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:51:46,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:51:46,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:51:46,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:51:46,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:51:46,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:51:46,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:51:46,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:51:46,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:51:46,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:51:46,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:51:46,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:51:46,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:51:46,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:51:46,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:51:46,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:51:46,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:51:46,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:51:46,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:51:46,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:51:46,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:51:46,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:51:46,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:51:46,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:51:46,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:51:46,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:51:46,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:51:46,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:51:46,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:51:46,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:51:46,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:51:46,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:51:46,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:51:46,308 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 16:51:46,329 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:51:46,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:51:46,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:51:46,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:51:46,332 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:51:46,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:51:46,332 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:51:46,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:51:46,333 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:51:46,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:51:46,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:51:46,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:51:46,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:51:46,335 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:51:46,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:51:46,335 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:51:46,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:51:46,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:51:46,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:51:46,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:51:46,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:51:46,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:51:46,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:51:46,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:51:46,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:51:46,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:51:46,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:51:46,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:51:46,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:51:46,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:51:46,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:51:46,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:51:46,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:51:46,638 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:51:46,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i [2019-12-18 16:51:46,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbaca790/4bde9f880d614f82bfed27ba5a730e4c/FLAGa0f920d07 [2019-12-18 16:51:47,250 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:51:47,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i [2019-12-18 16:51:47,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbaca790/4bde9f880d614f82bfed27ba5a730e4c/FLAGa0f920d07 [2019-12-18 16:51:47,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbaca790/4bde9f880d614f82bfed27ba5a730e4c [2019-12-18 16:51:47,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:51:47,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:51:47,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:51:47,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:51:47,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:51:47,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:51:47" (1/1) ... [2019-12-18 16:51:47,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:47, skipping insertion in model container [2019-12-18 16:51:47,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:51:47" (1/1) ... [2019-12-18 16:51:47,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:51:47,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:51:48,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:51:48,192 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:51:48,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:51:48,331 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:51:48,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48 WrapperNode [2019-12-18 16:51:48,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:51:48,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:51:48,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:51:48,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:51:48,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (1/1) ... [2019-12-18 16:51:48,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (1/1) ... [2019-12-18 16:51:48,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:51:48,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:51:48,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:51:48,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:51:48,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (1/1) ... [2019-12-18 16:51:48,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (1/1) ... [2019-12-18 16:51:48,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (1/1) ... [2019-12-18 16:51:48,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (1/1) ... [2019-12-18 16:51:48,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (1/1) ... [2019-12-18 16:51:48,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (1/1) ... [2019-12-18 16:51:48,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (1/1) ... [2019-12-18 16:51:48,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:51:48,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:51:48,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:51:48,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:51:48,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (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 16:51:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:51:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:51:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:51:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:51:48,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:51:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:51:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:51:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:51:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:51:48,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:51:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:51:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:51:48,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:51:48,500 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 16:51:49,259 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:51:49,259 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:51:49,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:51:49 BoogieIcfgContainer [2019-12-18 16:51:49,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:51:49,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:51:49,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:51:49,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:51:49,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:51:47" (1/3) ... [2019-12-18 16:51:49,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb8a980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:51:49, skipping insertion in model container [2019-12-18 16:51:49,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:51:48" (2/3) ... [2019-12-18 16:51:49,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb8a980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:51:49, skipping insertion in model container [2019-12-18 16:51:49,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:51:49" (3/3) ... [2019-12-18 16:51:49,269 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt.i [2019-12-18 16:51:49,277 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:51:49,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:51:49,285 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:51:49,286 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:51:49,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,325 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,325 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,365 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,365 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,366 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,366 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,366 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,372 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,373 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,381 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,381 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,382 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,389 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:49,413 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:51:49,433 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:51:49,433 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:51:49,433 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:51:49,433 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:51:49,433 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:51:49,433 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:51:49,434 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:51:49,434 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:51:49,454 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 16:51:49,456 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 16:51:49,564 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 16:51:49,564 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:51:49,583 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:51:49,609 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 16:51:49,656 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 16:51:49,656 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:51:49,676 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:51:49,696 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 16:51:49,698 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:51:55,218 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 16:51:55,341 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 16:51:55,363 INFO L206 etLargeBlockEncoding]: Checked pairs total: 73051 [2019-12-18 16:51:55,363 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 16:51:55,367 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 16:52:05,797 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83162 states. [2019-12-18 16:52:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 83162 states. [2019-12-18 16:52:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 16:52:05,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:05,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 16:52:05,806 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash 800250999, now seen corresponding path program 1 times [2019-12-18 16:52:05,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:05,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759869075] [2019-12-18 16:52:05,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:06,033 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 16:52:06,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759869075] [2019-12-18 16:52:06,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:06,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:52:06,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818422516] [2019-12-18 16:52:06,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:06,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:06,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:06,057 INFO L87 Difference]: Start difference. First operand 83162 states. Second operand 3 states. [2019-12-18 16:52:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:09,110 INFO L93 Difference]: Finished difference Result 82042 states and 356056 transitions. [2019-12-18 16:52:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:09,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 16:52:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:09,756 INFO L225 Difference]: With dead ends: 82042 [2019-12-18 16:52:09,757 INFO L226 Difference]: Without dead ends: 77338 [2019-12-18 16:52:09,758 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 16:52:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77338 states. [2019-12-18 16:52:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77338 to 77338. [2019-12-18 16:52:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77338 states. [2019-12-18 16:52:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77338 states to 77338 states and 335168 transitions. [2019-12-18 16:52:15,261 INFO L78 Accepts]: Start accepts. Automaton has 77338 states and 335168 transitions. Word has length 5 [2019-12-18 16:52:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:15,262 INFO L462 AbstractCegarLoop]: Abstraction has 77338 states and 335168 transitions. [2019-12-18 16:52:15,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 77338 states and 335168 transitions. [2019-12-18 16:52:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:52:15,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:15,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:15,271 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash -463413440, now seen corresponding path program 1 times [2019-12-18 16:52:15,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:15,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438635338] [2019-12-18 16:52:15,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:15,438 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 16:52:15,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438635338] [2019-12-18 16:52:15,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:15,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:15,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419051936] [2019-12-18 16:52:15,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:15,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:15,443 INFO L87 Difference]: Start difference. First operand 77338 states and 335168 transitions. Second operand 4 states. [2019-12-18 16:52:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:20,192 INFO L93 Difference]: Finished difference Result 119002 states and 493831 transitions. [2019-12-18 16:52:20,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:52:20,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:52:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:20,627 INFO L225 Difference]: With dead ends: 119002 [2019-12-18 16:52:20,628 INFO L226 Difference]: Without dead ends: 118911 [2019-12-18 16:52:20,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118911 states. [2019-12-18 16:52:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118911 to 109839. [2019-12-18 16:52:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109839 states. [2019-12-18 16:52:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109839 states to 109839 states and 460824 transitions. [2019-12-18 16:52:27,328 INFO L78 Accepts]: Start accepts. Automaton has 109839 states and 460824 transitions. Word has length 13 [2019-12-18 16:52:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:27,329 INFO L462 AbstractCegarLoop]: Abstraction has 109839 states and 460824 transitions. [2019-12-18 16:52:27,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 109839 states and 460824 transitions. [2019-12-18 16:52:27,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:52:27,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:27,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:27,332 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:27,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:27,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2092378622, now seen corresponding path program 1 times [2019-12-18 16:52:27,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:27,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780877517] [2019-12-18 16:52:27,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:27,461 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 16:52:27,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780877517] [2019-12-18 16:52:27,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:27,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:27,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211500319] [2019-12-18 16:52:27,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:27,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:27,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:27,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:27,465 INFO L87 Difference]: Start difference. First operand 109839 states and 460824 transitions. Second operand 4 states. [2019-12-18 16:52:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:28,507 INFO L93 Difference]: Finished difference Result 153490 states and 628667 transitions. [2019-12-18 16:52:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:52:28,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:52:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:34,287 INFO L225 Difference]: With dead ends: 153490 [2019-12-18 16:52:34,288 INFO L226 Difference]: Without dead ends: 153386 [2019-12-18 16:52:34,288 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 16:52:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153386 states. [2019-12-18 16:52:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153386 to 130549. [2019-12-18 16:52:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130549 states. [2019-12-18 16:52:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130549 states to 130549 states and 543763 transitions. [2019-12-18 16:52:40,188 INFO L78 Accepts]: Start accepts. Automaton has 130549 states and 543763 transitions. Word has length 13 [2019-12-18 16:52:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:40,189 INFO L462 AbstractCegarLoop]: Abstraction has 130549 states and 543763 transitions. [2019-12-18 16:52:40,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 130549 states and 543763 transitions. [2019-12-18 16:52:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:52:40,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:40,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:40,195 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:40,195 INFO L82 PathProgramCache]: Analyzing trace with hash 740124844, now seen corresponding path program 1 times [2019-12-18 16:52:40,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:40,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437581142] [2019-12-18 16:52:40,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:40,296 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 16:52:40,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437581142] [2019-12-18 16:52:40,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:40,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:40,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736074411] [2019-12-18 16:52:40,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:40,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:40,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:40,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:40,299 INFO L87 Difference]: Start difference. First operand 130549 states and 543763 transitions. Second operand 4 states. [2019-12-18 16:52:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:42,543 INFO L93 Difference]: Finished difference Result 162838 states and 668586 transitions. [2019-12-18 16:52:42,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:52:42,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:52:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:43,036 INFO L225 Difference]: With dead ends: 162838 [2019-12-18 16:52:43,036 INFO L226 Difference]: Without dead ends: 162750 [2019-12-18 16:52:43,037 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 16:52:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162750 states. [2019-12-18 16:52:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162750 to 140790. [2019-12-18 16:52:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140790 states. [2019-12-18 16:52:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140790 states to 140790 states and 584562 transitions. [2019-12-18 16:52:55,807 INFO L78 Accepts]: Start accepts. Automaton has 140790 states and 584562 transitions. Word has length 14 [2019-12-18 16:52:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:55,807 INFO L462 AbstractCegarLoop]: Abstraction has 140790 states and 584562 transitions. [2019-12-18 16:52:55,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 140790 states and 584562 transitions. [2019-12-18 16:52:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:52:55,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:55,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:55,812 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:55,813 INFO L82 PathProgramCache]: Analyzing trace with hash 739988072, now seen corresponding path program 1 times [2019-12-18 16:52:55,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:55,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773460137] [2019-12-18 16:52:55,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:55,860 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 16:52:55,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773460137] [2019-12-18 16:52:55,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:55,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:55,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609494927] [2019-12-18 16:52:55,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:55,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:55,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:55,863 INFO L87 Difference]: Start difference. First operand 140790 states and 584562 transitions. Second operand 3 states. [2019-12-18 16:52:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:56,873 INFO L93 Difference]: Finished difference Result 195371 states and 811522 transitions. [2019-12-18 16:52:56,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:56,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 16:52:56,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:57,441 INFO L225 Difference]: With dead ends: 195371 [2019-12-18 16:52:57,441 INFO L226 Difference]: Without dead ends: 195371 [2019-12-18 16:52:57,441 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 16:53:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195371 states. [2019-12-18 16:53:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195371 to 171215. [2019-12-18 16:53:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171215 states. [2019-12-18 16:53:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171215 states to 171215 states and 713371 transitions. [2019-12-18 16:53:11,894 INFO L78 Accepts]: Start accepts. Automaton has 171215 states and 713371 transitions. Word has length 14 [2019-12-18 16:53:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:11,894 INFO L462 AbstractCegarLoop]: Abstraction has 171215 states and 713371 transitions. [2019-12-18 16:53:11,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:53:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 171215 states and 713371 transitions. [2019-12-18 16:53:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:53:11,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:11,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:11,898 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash 575422588, now seen corresponding path program 1 times [2019-12-18 16:53:11,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:11,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925716784] [2019-12-18 16:53:11,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:11,986 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 16:53:11,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925716784] [2019-12-18 16:53:11,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:11,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:11,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107502030] [2019-12-18 16:53:11,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:53:11,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:11,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:53:11,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:11,989 INFO L87 Difference]: Start difference. First operand 171215 states and 713371 transitions. Second operand 4 states. [2019-12-18 16:53:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:13,212 INFO L93 Difference]: Finished difference Result 200032 states and 824493 transitions. [2019-12-18 16:53:13,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:53:13,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:53:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:21,395 INFO L225 Difference]: With dead ends: 200032 [2019-12-18 16:53:21,395 INFO L226 Difference]: Without dead ends: 199944 [2019-12-18 16:53:21,395 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 16:53:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199944 states. [2019-12-18 16:53:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199944 to 173869. [2019-12-18 16:53:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173869 states. [2019-12-18 16:53:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173869 states to 173869 states and 724501 transitions. [2019-12-18 16:53:28,931 INFO L78 Accepts]: Start accepts. Automaton has 173869 states and 724501 transitions. Word has length 14 [2019-12-18 16:53:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:28,932 INFO L462 AbstractCegarLoop]: Abstraction has 173869 states and 724501 transitions. [2019-12-18 16:53:28,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:53:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 173869 states and 724501 transitions. [2019-12-18 16:53:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 16:53:28,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:28,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:28,952 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1027045792, now seen corresponding path program 1 times [2019-12-18 16:53:28,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:28,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018148208] [2019-12-18 16:53:28,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:28,993 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 16:53:28,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018148208] [2019-12-18 16:53:28,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:28,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:53:28,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367953940] [2019-12-18 16:53:28,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:28,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:28,996 INFO L87 Difference]: Start difference. First operand 173869 states and 724501 transitions. Second operand 3 states. [2019-12-18 16:53:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:31,056 INFO L93 Difference]: Finished difference Result 173738 states and 723945 transitions. [2019-12-18 16:53:31,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:31,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 16:53:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:31,584 INFO L225 Difference]: With dead ends: 173738 [2019-12-18 16:53:31,584 INFO L226 Difference]: Without dead ends: 173738 [2019-12-18 16:53:31,584 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 16:53:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173738 states. [2019-12-18 16:53:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173738 to 173738. [2019-12-18 16:53:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173738 states. [2019-12-18 16:53:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173738 states to 173738 states and 723945 transitions. [2019-12-18 16:53:45,800 INFO L78 Accepts]: Start accepts. Automaton has 173738 states and 723945 transitions. Word has length 18 [2019-12-18 16:53:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:45,800 INFO L462 AbstractCegarLoop]: Abstraction has 173738 states and 723945 transitions. [2019-12-18 16:53:45,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:53:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 173738 states and 723945 transitions. [2019-12-18 16:53:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:53:45,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:45,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:45,824 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:45,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash 930576187, now seen corresponding path program 1 times [2019-12-18 16:53:45,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:45,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071358914] [2019-12-18 16:53:45,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:45,870 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 16:53:45,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071358914] [2019-12-18 16:53:45,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:45,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:45,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238368825] [2019-12-18 16:53:45,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:45,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:45,872 INFO L87 Difference]: Start difference. First operand 173738 states and 723945 transitions. Second operand 3 states. [2019-12-18 16:53:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:53,241 INFO L93 Difference]: Finished difference Result 286764 states and 1191382 transitions. [2019-12-18 16:53:53,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:53,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 16:53:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:53,734 INFO L225 Difference]: With dead ends: 286764 [2019-12-18 16:53:53,734 INFO L226 Difference]: Without dead ends: 162140 [2019-12-18 16:53:53,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162140 states. [2019-12-18 16:54:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162140 to 153170. [2019-12-18 16:54:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153170 states. [2019-12-18 16:54:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153170 states to 153170 states and 628295 transitions. [2019-12-18 16:54:06,043 INFO L78 Accepts]: Start accepts. Automaton has 153170 states and 628295 transitions. Word has length 19 [2019-12-18 16:54:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:06,044 INFO L462 AbstractCegarLoop]: Abstraction has 153170 states and 628295 transitions. [2019-12-18 16:54:06,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:54:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 153170 states and 628295 transitions. [2019-12-18 16:54:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:54:06,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:06,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:06,063 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1809324800, now seen corresponding path program 1 times [2019-12-18 16:54:06,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:06,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047381419] [2019-12-18 16:54:06,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:06,108 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 16:54:06,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047381419] [2019-12-18 16:54:06,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:06,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:54:06,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597287447] [2019-12-18 16:54:06,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:54:06,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:54:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:06,111 INFO L87 Difference]: Start difference. First operand 153170 states and 628295 transitions. Second operand 3 states. [2019-12-18 16:54:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:06,900 INFO L93 Difference]: Finished difference Result 145211 states and 588530 transitions. [2019-12-18 16:54:06,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:54:06,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 16:54:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:13,116 INFO L225 Difference]: With dead ends: 145211 [2019-12-18 16:54:13,117 INFO L226 Difference]: Without dead ends: 145211 [2019-12-18 16:54:13,117 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 16:54:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145211 states. [2019-12-18 16:54:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145211 to 143797. [2019-12-18 16:54:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143797 states. [2019-12-18 16:54:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143797 states to 143797 states and 583330 transitions. [2019-12-18 16:54:19,411 INFO L78 Accepts]: Start accepts. Automaton has 143797 states and 583330 transitions. Word has length 19 [2019-12-18 16:54:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:19,411 INFO L462 AbstractCegarLoop]: Abstraction has 143797 states and 583330 transitions. [2019-12-18 16:54:19,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:54:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 143797 states and 583330 transitions. [2019-12-18 16:54:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:54:19,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:19,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:19,427 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:19,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1754353062, now seen corresponding path program 1 times [2019-12-18 16:54:19,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:19,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405900145] [2019-12-18 16:54:19,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:19,498 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 16:54:19,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405900145] [2019-12-18 16:54:19,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:19,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:54:19,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778241225] [2019-12-18 16:54:19,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:54:19,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:54:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:19,500 INFO L87 Difference]: Start difference. First operand 143797 states and 583330 transitions. Second operand 5 states. [2019-12-18 16:54:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:20,896 INFO L93 Difference]: Finished difference Result 191486 states and 758167 transitions. [2019-12-18 16:54:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:54:20,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 16:54:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:27,283 INFO L225 Difference]: With dead ends: 191486 [2019-12-18 16:54:27,283 INFO L226 Difference]: Without dead ends: 191267 [2019-12-18 16:54:27,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 16:54:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191267 states. [2019-12-18 16:54:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191267 to 152009. [2019-12-18 16:54:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152009 states. [2019-12-18 16:54:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152009 states to 152009 states and 614599 transitions. [2019-12-18 16:54:34,133 INFO L78 Accepts]: Start accepts. Automaton has 152009 states and 614599 transitions. Word has length 19 [2019-12-18 16:54:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:34,133 INFO L462 AbstractCegarLoop]: Abstraction has 152009 states and 614599 transitions. [2019-12-18 16:54:34,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:54:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 152009 states and 614599 transitions. [2019-12-18 16:54:34,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:54:34,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:34,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:34,148 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash 422869821, now seen corresponding path program 1 times [2019-12-18 16:54:34,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:34,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496996820] [2019-12-18 16:54:34,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:34,249 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 16:54:34,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496996820] [2019-12-18 16:54:34,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:34,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:54:34,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109536501] [2019-12-18 16:54:34,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:54:34,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:34,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:54:34,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:54:34,253 INFO L87 Difference]: Start difference. First operand 152009 states and 614599 transitions. Second operand 4 states. [2019-12-18 16:54:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:34,503 INFO L93 Difference]: Finished difference Result 37859 states and 130356 transitions. [2019-12-18 16:54:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:54:34,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 16:54:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:34,576 INFO L225 Difference]: With dead ends: 37859 [2019-12-18 16:54:34,577 INFO L226 Difference]: Without dead ends: 29780 [2019-12-18 16:54:34,577 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 16:54:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29780 states. [2019-12-18 16:54:36,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29780 to 29780. [2019-12-18 16:54:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29780 states. [2019-12-18 16:54:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29780 states to 29780 states and 97851 transitions. [2019-12-18 16:54:36,171 INFO L78 Accepts]: Start accepts. Automaton has 29780 states and 97851 transitions. Word has length 19 [2019-12-18 16:54:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:36,171 INFO L462 AbstractCegarLoop]: Abstraction has 29780 states and 97851 transitions. [2019-12-18 16:54:36,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:54:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 29780 states and 97851 transitions. [2019-12-18 16:54:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:54:36,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:36,178 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] [2019-12-18 16:54:36,178 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash -532738305, now seen corresponding path program 1 times [2019-12-18 16:54:36,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:36,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157227412] [2019-12-18 16:54:36,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:36,235 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 16:54:36,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157227412] [2019-12-18 16:54:36,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:36,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:54:36,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78966300] [2019-12-18 16:54:36,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:54:36,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:36,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:54:36,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:36,237 INFO L87 Difference]: Start difference. First operand 29780 states and 97851 transitions. Second operand 5 states. [2019-12-18 16:54:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:36,737 INFO L93 Difference]: Finished difference Result 39465 states and 127242 transitions. [2019-12-18 16:54:36,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:54:36,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:54:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:36,800 INFO L225 Difference]: With dead ends: 39465 [2019-12-18 16:54:36,800 INFO L226 Difference]: Without dead ends: 39274 [2019-12-18 16:54:36,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 16:54:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39274 states. [2019-12-18 16:54:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39274 to 30971. [2019-12-18 16:54:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30971 states. [2019-12-18 16:54:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30971 states to 30971 states and 101410 transitions. [2019-12-18 16:54:37,392 INFO L78 Accepts]: Start accepts. Automaton has 30971 states and 101410 transitions. Word has length 22 [2019-12-18 16:54:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:37,393 INFO L462 AbstractCegarLoop]: Abstraction has 30971 states and 101410 transitions. [2019-12-18 16:54:37,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:54:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 30971 states and 101410 transitions. [2019-12-18 16:54:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:54:37,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:37,400 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] [2019-12-18 16:54:37,400 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:37,400 INFO L82 PathProgramCache]: Analyzing trace with hash 828372869, now seen corresponding path program 1 times [2019-12-18 16:54:37,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:37,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925293232] [2019-12-18 16:54:37,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:37,461 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 16:54:37,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925293232] [2019-12-18 16:54:37,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:37,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:54:37,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268026526] [2019-12-18 16:54:37,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:54:37,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:54:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:37,464 INFO L87 Difference]: Start difference. First operand 30971 states and 101410 transitions. Second operand 5 states. [2019-12-18 16:54:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:37,942 INFO L93 Difference]: Finished difference Result 39564 states and 127608 transitions. [2019-12-18 16:54:37,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:54:37,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:54:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:38,006 INFO L225 Difference]: With dead ends: 39564 [2019-12-18 16:54:38,006 INFO L226 Difference]: Without dead ends: 39295 [2019-12-18 16:54:38,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 16:54:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39295 states. [2019-12-18 16:54:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39295 to 29549. [2019-12-18 16:54:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29549 states. [2019-12-18 16:54:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29549 states to 29549 states and 96955 transitions. [2019-12-18 16:54:39,564 INFO L78 Accepts]: Start accepts. Automaton has 29549 states and 96955 transitions. Word has length 22 [2019-12-18 16:54:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:39,565 INFO L462 AbstractCegarLoop]: Abstraction has 29549 states and 96955 transitions. [2019-12-18 16:54:39,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:54:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 29549 states and 96955 transitions. [2019-12-18 16:54:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:54:39,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:39,580 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] [2019-12-18 16:54:39,580 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:39,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1106278827, now seen corresponding path program 1 times [2019-12-18 16:54:39,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:39,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719978156] [2019-12-18 16:54:39,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:39,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:39,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719978156] [2019-12-18 16:54:39,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:39,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:54:39,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627381838] [2019-12-18 16:54:39,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:54:39,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:54:39,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:39,643 INFO L87 Difference]: Start difference. First operand 29549 states and 96955 transitions. Second operand 5 states. [2019-12-18 16:54:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:40,046 INFO L93 Difference]: Finished difference Result 40243 states and 130195 transitions. [2019-12-18 16:54:40,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:54:40,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:54:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:40,113 INFO L225 Difference]: With dead ends: 40243 [2019-12-18 16:54:40,113 INFO L226 Difference]: Without dead ends: 40219 [2019-12-18 16:54:40,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40219 states. [2019-12-18 16:54:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40219 to 32671. [2019-12-18 16:54:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32671 states. [2019-12-18 16:54:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32671 states to 32671 states and 106843 transitions. [2019-12-18 16:54:42,708 INFO L78 Accepts]: Start accepts. Automaton has 32671 states and 106843 transitions. Word has length 28 [2019-12-18 16:54:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:42,709 INFO L462 AbstractCegarLoop]: Abstraction has 32671 states and 106843 transitions. [2019-12-18 16:54:42,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:54:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 32671 states and 106843 transitions. [2019-12-18 16:54:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 16:54:42,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:42,730 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] [2019-12-18 16:54:42,730 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1126449648, now seen corresponding path program 1 times [2019-12-18 16:54:42,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:42,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594187265] [2019-12-18 16:54:42,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:42,784 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 16:54:42,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594187265] [2019-12-18 16:54:42,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:42,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:54:42,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434465786] [2019-12-18 16:54:42,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:54:42,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:54:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:42,786 INFO L87 Difference]: Start difference. First operand 32671 states and 106843 transitions. Second operand 5 states. [2019-12-18 16:54:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:43,173 INFO L93 Difference]: Finished difference Result 41985 states and 135178 transitions. [2019-12-18 16:54:43,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:54:43,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 16:54:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:43,241 INFO L225 Difference]: With dead ends: 41985 [2019-12-18 16:54:43,241 INFO L226 Difference]: Without dead ends: 41961 [2019-12-18 16:54:43,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41961 states. [2019-12-18 16:54:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41961 to 32060. [2019-12-18 16:54:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32060 states. [2019-12-18 16:54:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32060 states to 32060 states and 104673 transitions. [2019-12-18 16:54:43,864 INFO L78 Accepts]: Start accepts. Automaton has 32060 states and 104673 transitions. Word has length 29 [2019-12-18 16:54:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:43,865 INFO L462 AbstractCegarLoop]: Abstraction has 32060 states and 104673 transitions. [2019-12-18 16:54:43,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:54:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 32060 states and 104673 transitions. [2019-12-18 16:54:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 16:54:43,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:43,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] [2019-12-18 16:54:43,881 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:43,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:43,882 INFO L82 PathProgramCache]: Analyzing trace with hash -14540022, now seen corresponding path program 1 times [2019-12-18 16:54:43,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:43,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144783967] [2019-12-18 16:54:43,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:43,954 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 16:54:43,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144783967] [2019-12-18 16:54:43,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:43,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:54:43,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131259891] [2019-12-18 16:54:43,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:54:43,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:54:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:43,956 INFO L87 Difference]: Start difference. First operand 32060 states and 104673 transitions. Second operand 5 states. [2019-12-18 16:54:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:44,050 INFO L93 Difference]: Finished difference Result 13714 states and 42374 transitions. [2019-12-18 16:54:44,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:54:44,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 16:54:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:44,068 INFO L225 Difference]: With dead ends: 13714 [2019-12-18 16:54:44,068 INFO L226 Difference]: Without dead ends: 11900 [2019-12-18 16:54:44,069 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 16:54:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2019-12-18 16:54:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 11593. [2019-12-18 16:54:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11593 states. [2019-12-18 16:54:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11593 states to 11593 states and 35673 transitions. [2019-12-18 16:54:44,246 INFO L78 Accepts]: Start accepts. Automaton has 11593 states and 35673 transitions. Word has length 30 [2019-12-18 16:54:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:44,246 INFO L462 AbstractCegarLoop]: Abstraction has 11593 states and 35673 transitions. [2019-12-18 16:54:44,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:54:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 11593 states and 35673 transitions. [2019-12-18 16:54:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:54:44,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:44,260 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] [2019-12-18 16:54:44,260 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash -761398124, now seen corresponding path program 1 times [2019-12-18 16:54:44,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:44,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393130597] [2019-12-18 16:54:44,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:44,636 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 16:54:44,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393130597] [2019-12-18 16:54:44,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:44,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:54:44,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233366630] [2019-12-18 16:54:44,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:54:44,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:44,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:54:44,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:54:44,639 INFO L87 Difference]: Start difference. First operand 11593 states and 35673 transitions. Second operand 6 states. [2019-12-18 16:54:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:45,151 INFO L93 Difference]: Finished difference Result 14689 states and 43755 transitions. [2019-12-18 16:54:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:54:45,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 16:54:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:45,180 INFO L225 Difference]: With dead ends: 14689 [2019-12-18 16:54:45,180 INFO L226 Difference]: Without dead ends: 14687 [2019-12-18 16:54:45,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:54:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14687 states. [2019-12-18 16:54:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14687 to 11869. [2019-12-18 16:54:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11869 states. [2019-12-18 16:54:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 36412 transitions. [2019-12-18 16:54:45,390 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 36412 transitions. Word has length 40 [2019-12-18 16:54:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:45,390 INFO L462 AbstractCegarLoop]: Abstraction has 11869 states and 36412 transitions. [2019-12-18 16:54:45,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:54:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 36412 transitions. [2019-12-18 16:54:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:54:45,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:45,403 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] [2019-12-18 16:54:45,403 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1633369453, now seen corresponding path program 1 times [2019-12-18 16:54:45,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:45,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709065255] [2019-12-18 16:54:45,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:45,470 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 16:54:45,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709065255] [2019-12-18 16:54:45,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:45,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:54:45,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148450288] [2019-12-18 16:54:45,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:54:45,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:54:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:45,472 INFO L87 Difference]: Start difference. First operand 11869 states and 36412 transitions. Second operand 5 states. [2019-12-18 16:54:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:46,003 INFO L93 Difference]: Finished difference Result 18223 states and 55480 transitions. [2019-12-18 16:54:46,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:54:46,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:54:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:46,029 INFO L225 Difference]: With dead ends: 18223 [2019-12-18 16:54:46,030 INFO L226 Difference]: Without dead ends: 18223 [2019-12-18 16:54:46,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:54:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2019-12-18 16:54:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 15984. [2019-12-18 16:54:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15984 states. [2019-12-18 16:54:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15984 states to 15984 states and 49182 transitions. [2019-12-18 16:54:46,285 INFO L78 Accepts]: Start accepts. Automaton has 15984 states and 49182 transitions. Word has length 40 [2019-12-18 16:54:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:46,285 INFO L462 AbstractCegarLoop]: Abstraction has 15984 states and 49182 transitions. [2019-12-18 16:54:46,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:54:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 15984 states and 49182 transitions. [2019-12-18 16:54:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:54:46,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:46,309 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] [2019-12-18 16:54:46,309 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:46,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:46,310 INFO L82 PathProgramCache]: Analyzing trace with hash -308441065, now seen corresponding path program 2 times [2019-12-18 16:54:46,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:46,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394247945] [2019-12-18 16:54:46,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:46,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394247945] [2019-12-18 16:54:46,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:46,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:54:46,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784311658] [2019-12-18 16:54:46,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:54:46,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:46,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:54:46,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:46,382 INFO L87 Difference]: Start difference. First operand 15984 states and 49182 transitions. Second operand 3 states. [2019-12-18 16:54:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:46,459 INFO L93 Difference]: Finished difference Result 15143 states and 45952 transitions. [2019-12-18 16:54:46,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:54:46,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 16:54:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:46,488 INFO L225 Difference]: With dead ends: 15143 [2019-12-18 16:54:46,488 INFO L226 Difference]: Without dead ends: 15143 [2019-12-18 16:54:46,488 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 16:54:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-18 16:54:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 14516. [2019-12-18 16:54:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14516 states. [2019-12-18 16:54:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14516 states to 14516 states and 44169 transitions. [2019-12-18 16:54:46,722 INFO L78 Accepts]: Start accepts. Automaton has 14516 states and 44169 transitions. Word has length 40 [2019-12-18 16:54:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:46,722 INFO L462 AbstractCegarLoop]: Abstraction has 14516 states and 44169 transitions. [2019-12-18 16:54:46,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:54:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 14516 states and 44169 transitions. [2019-12-18 16:54:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 16:54:46,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:46,744 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] [2019-12-18 16:54:46,745 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:46,745 INFO L82 PathProgramCache]: Analyzing trace with hash 797278347, now seen corresponding path program 1 times [2019-12-18 16:54:46,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:46,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657359968] [2019-12-18 16:54:46,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:46,820 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 16:54:46,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657359968] [2019-12-18 16:54:46,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:46,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:54:46,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024492831] [2019-12-18 16:54:46,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:54:46,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:46,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:54:46,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:54:46,823 INFO L87 Difference]: Start difference. First operand 14516 states and 44169 transitions. Second operand 6 states. [2019-12-18 16:54:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:46,964 INFO L93 Difference]: Finished difference Result 13316 states and 41264 transitions. [2019-12-18 16:54:46,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:54:46,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 16:54:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:46,991 INFO L225 Difference]: With dead ends: 13316 [2019-12-18 16:54:46,991 INFO L226 Difference]: Without dead ends: 11938 [2019-12-18 16:54:46,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:54:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11938 states. [2019-12-18 16:54:47,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11938 to 11130. [2019-12-18 16:54:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11130 states. [2019-12-18 16:54:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11130 states to 11130 states and 35538 transitions. [2019-12-18 16:54:47,465 INFO L78 Accepts]: Start accepts. Automaton has 11130 states and 35538 transitions. Word has length 41 [2019-12-18 16:54:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:47,465 INFO L462 AbstractCegarLoop]: Abstraction has 11130 states and 35538 transitions. [2019-12-18 16:54:47,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:54:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 11130 states and 35538 transitions. [2019-12-18 16:54:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:54:47,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:47,482 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, 1, 1] [2019-12-18 16:54:47,482 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash 852736153, now seen corresponding path program 1 times [2019-12-18 16:54:47,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:47,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066122108] [2019-12-18 16:54:47,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:47,534 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 16:54:47,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066122108] [2019-12-18 16:54:47,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:47,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:54:47,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538241075] [2019-12-18 16:54:47,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:54:47,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:47,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:54:47,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:47,536 INFO L87 Difference]: Start difference. First operand 11130 states and 35538 transitions. Second operand 3 states. [2019-12-18 16:54:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:47,630 INFO L93 Difference]: Finished difference Result 12575 states and 38277 transitions. [2019-12-18 16:54:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:54:47,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 16:54:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:47,657 INFO L225 Difference]: With dead ends: 12575 [2019-12-18 16:54:47,657 INFO L226 Difference]: Without dead ends: 12575 [2019-12-18 16:54:47,658 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 16:54:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-12-18 16:54:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 9907. [2019-12-18 16:54:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9907 states. [2019-12-18 16:54:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9907 states to 9907 states and 30647 transitions. [2019-12-18 16:54:47,986 INFO L78 Accepts]: Start accepts. Automaton has 9907 states and 30647 transitions. Word has length 56 [2019-12-18 16:54:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:47,987 INFO L462 AbstractCegarLoop]: Abstraction has 9907 states and 30647 transitions. [2019-12-18 16:54:47,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:54:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 9907 states and 30647 transitions. [2019-12-18 16:54:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:54:48,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:48,007 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, 1, 1] [2019-12-18 16:54:48,007 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash -415784116, now seen corresponding path program 1 times [2019-12-18 16:54:48,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:48,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64866979] [2019-12-18 16:54:48,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:48,074 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 16:54:48,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64866979] [2019-12-18 16:54:48,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:48,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:54:48,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045396053] [2019-12-18 16:54:48,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:54:48,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:48,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:54:48,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:54:48,077 INFO L87 Difference]: Start difference. First operand 9907 states and 30647 transitions. Second operand 4 states. [2019-12-18 16:54:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:48,192 INFO L93 Difference]: Finished difference Result 16499 states and 51208 transitions. [2019-12-18 16:54:48,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:54:48,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 16:54:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:48,210 INFO L225 Difference]: With dead ends: 16499 [2019-12-18 16:54:48,211 INFO L226 Difference]: Without dead ends: 6904 [2019-12-18 16:54:48,211 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 16:54:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2019-12-18 16:54:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6904. [2019-12-18 16:54:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2019-12-18 16:54:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 21383 transitions. [2019-12-18 16:54:48,420 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 21383 transitions. Word has length 56 [2019-12-18 16:54:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:48,420 INFO L462 AbstractCegarLoop]: Abstraction has 6904 states and 21383 transitions. [2019-12-18 16:54:48,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:54:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 21383 transitions. [2019-12-18 16:54:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:54:48,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:48,433 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, 1, 1] [2019-12-18 16:54:48,433 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1395977884, now seen corresponding path program 2 times [2019-12-18 16:54:48,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:48,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471689965] [2019-12-18 16:54:48,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:48,643 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 16:54:48,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471689965] [2019-12-18 16:54:48,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:48,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:54:48,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503515367] [2019-12-18 16:54:48,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:54:48,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:54:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:54:48,649 INFO L87 Difference]: Start difference. First operand 6904 states and 21383 transitions. Second operand 11 states. [2019-12-18 16:54:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:50,352 INFO L93 Difference]: Finished difference Result 14753 states and 44500 transitions. [2019-12-18 16:54:50,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 16:54:50,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 16:54:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:50,369 INFO L225 Difference]: With dead ends: 14753 [2019-12-18 16:54:50,369 INFO L226 Difference]: Without dead ends: 9207 [2019-12-18 16:54:50,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:54:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9207 states. [2019-12-18 16:54:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9207 to 8456. [2019-12-18 16:54:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8456 states. [2019-12-18 16:54:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8456 states to 8456 states and 25546 transitions. [2019-12-18 16:54:50,498 INFO L78 Accepts]: Start accepts. Automaton has 8456 states and 25546 transitions. Word has length 56 [2019-12-18 16:54:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:50,498 INFO L462 AbstractCegarLoop]: Abstraction has 8456 states and 25546 transitions. [2019-12-18 16:54:50,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:54:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8456 states and 25546 transitions. [2019-12-18 16:54:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:54:50,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:50,510 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, 1, 1] [2019-12-18 16:54:50,511 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash 72457218, now seen corresponding path program 3 times [2019-12-18 16:54:50,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:50,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45610913] [2019-12-18 16:54:50,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:50,682 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 16:54:50,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45610913] [2019-12-18 16:54:50,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:50,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:54:50,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570438888] [2019-12-18 16:54:50,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:54:50,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:54:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:54:50,685 INFO L87 Difference]: Start difference. First operand 8456 states and 25546 transitions. Second operand 12 states. [2019-12-18 16:54:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:52,655 INFO L93 Difference]: Finished difference Result 12639 states and 37530 transitions. [2019-12-18 16:54:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 16:54:52,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 16:54:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:52,669 INFO L225 Difference]: With dead ends: 12639 [2019-12-18 16:54:52,670 INFO L226 Difference]: Without dead ends: 9027 [2019-12-18 16:54:52,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2019-12-18 16:54:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9027 states. [2019-12-18 16:54:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9027 to 8402. [2019-12-18 16:54:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8402 states. [2019-12-18 16:54:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8402 states to 8402 states and 25395 transitions. [2019-12-18 16:54:52,797 INFO L78 Accepts]: Start accepts. Automaton has 8402 states and 25395 transitions. Word has length 56 [2019-12-18 16:54:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:52,797 INFO L462 AbstractCegarLoop]: Abstraction has 8402 states and 25395 transitions. [2019-12-18 16:54:52,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:54:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 8402 states and 25395 transitions. [2019-12-18 16:54:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:54:52,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:52,807 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, 1, 1] [2019-12-18 16:54:52,807 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:52,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:52,807 INFO L82 PathProgramCache]: Analyzing trace with hash -112232742, now seen corresponding path program 4 times [2019-12-18 16:54:52,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:52,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657003590] [2019-12-18 16:54:52,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:52,961 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 16:54:52,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657003590] [2019-12-18 16:54:52,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:52,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:54:52,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565312394] [2019-12-18 16:54:52,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:54:52,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:52,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:54:52,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:54:52,964 INFO L87 Difference]: Start difference. First operand 8402 states and 25395 transitions. Second operand 11 states. [2019-12-18 16:54:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:54,305 INFO L93 Difference]: Finished difference Result 13307 states and 39164 transitions. [2019-12-18 16:54:54,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 16:54:54,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 16:54:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:54,321 INFO L225 Difference]: With dead ends: 13307 [2019-12-18 16:54:54,321 INFO L226 Difference]: Without dead ends: 10374 [2019-12-18 16:54:54,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:54:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10374 states. [2019-12-18 16:54:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10374 to 8858. [2019-12-18 16:54:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8858 states. [2019-12-18 16:54:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 26470 transitions. [2019-12-18 16:54:54,462 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 26470 transitions. Word has length 56 [2019-12-18 16:54:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:54,462 INFO L462 AbstractCegarLoop]: Abstraction has 8858 states and 26470 transitions. [2019-12-18 16:54:54,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:54:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 26470 transitions. [2019-12-18 16:54:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:54:54,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:54,472 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, 1, 1] [2019-12-18 16:54:54,472 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:54,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:54,472 INFO L82 PathProgramCache]: Analyzing trace with hash 894722750, now seen corresponding path program 5 times [2019-12-18 16:54:54,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:54,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337915466] [2019-12-18 16:54:54,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:54,658 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 16:54:54,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337915466] [2019-12-18 16:54:54,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:54,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:54:54,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383198850] [2019-12-18 16:54:54,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:54:54,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:54,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:54:54,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:54:54,661 INFO L87 Difference]: Start difference. First operand 8858 states and 26470 transitions. Second operand 12 states. [2019-12-18 16:54:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:56,143 INFO L93 Difference]: Finished difference Result 11588 states and 34200 transitions. [2019-12-18 16:54:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 16:54:56,143 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 16:54:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:56,157 INFO L225 Difference]: With dead ends: 11588 [2019-12-18 16:54:56,157 INFO L226 Difference]: Without dead ends: 9692 [2019-12-18 16:54:56,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-12-18 16:54:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2019-12-18 16:54:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 8339. [2019-12-18 16:54:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8339 states. [2019-12-18 16:54:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8339 states to 8339 states and 25077 transitions. [2019-12-18 16:54:56,419 INFO L78 Accepts]: Start accepts. Automaton has 8339 states and 25077 transitions. Word has length 56 [2019-12-18 16:54:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:56,420 INFO L462 AbstractCegarLoop]: Abstraction has 8339 states and 25077 transitions. [2019-12-18 16:54:56,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:54:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 8339 states and 25077 transitions. [2019-12-18 16:54:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:54:56,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:56,429 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, 1, 1] [2019-12-18 16:54:56,429 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:56,429 INFO L82 PathProgramCache]: Analyzing trace with hash -758590514, now seen corresponding path program 6 times [2019-12-18 16:54:56,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:56,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210798297] [2019-12-18 16:54:56,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:56,735 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 16:54:56,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210798297] [2019-12-18 16:54:56,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:56,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:54:56,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919871271] [2019-12-18 16:54:56,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:54:56,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:56,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:54:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:54:56,739 INFO L87 Difference]: Start difference. First operand 8339 states and 25077 transitions. Second operand 11 states. [2019-12-18 16:54:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:57,677 INFO L93 Difference]: Finished difference Result 12872 states and 38263 transitions. [2019-12-18 16:54:57,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 16:54:57,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 16:54:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:57,693 INFO L225 Difference]: With dead ends: 12872 [2019-12-18 16:54:57,693 INFO L226 Difference]: Without dead ends: 9257 [2019-12-18 16:54:57,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2019-12-18 16:54:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9257 states. [2019-12-18 16:54:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9257 to 8163. [2019-12-18 16:54:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8163 states. [2019-12-18 16:54:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 24528 transitions. [2019-12-18 16:54:57,832 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 24528 transitions. Word has length 56 [2019-12-18 16:54:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:57,833 INFO L462 AbstractCegarLoop]: Abstraction has 8163 states and 24528 transitions. [2019-12-18 16:54:57,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:54:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 24528 transitions. [2019-12-18 16:54:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:54:57,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:57,842 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, 1, 1] [2019-12-18 16:54:57,843 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1474997086, now seen corresponding path program 7 times [2019-12-18 16:54:57,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:57,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972473161] [2019-12-18 16:54:57,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:54:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:54:57,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:54:57,946 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:54:57,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= 0 v_~weak$$choice0~0_31) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_191) (= v_~main$tmp_guard1~0_50 0) (= v_~x$flush_delayed~0_46 0) (= v_~weak$$choice2~0_179 0) (= v_~x$r_buff0_thd1~0_355 0) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff0~0_341) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~main$tmp_guard0~0_45 0) (= 0 v_~x$r_buff1_thd3~0_194) (= v_~y~0_194 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t666~0.base_35| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t666~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t666~0.base_35|) |v_ULTIMATE.start_main_~#t666~0.offset_25| 0)) |v_#memory_int_15|) (= 0 v_~x$r_buff0_thd2~0_248) (= 0 v_~__unbuffered_cnt~0_63) (= 0 v_~x~0_215) (= v_~x$r_buff1_thd0~0_218 0) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$w_buff0_used~0_867) (= v_~__unbuffered_p2_EBX~0_66 0) (= v_~z~0_56 0) (= 0 v_~__unbuffered_p2_EAX~0_66) (= v_~x$r_buff0_thd0~0_151 0) (= v_~x$mem_tmp~0_33 0) (= v_~x$r_buff1_thd1~0_359 0) (= 0 v_~x$w_buff1~0_257) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t666~0.base_35|)) (= 0 |v_#NULL.base_3|) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t666~0.base_35| 1)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t666~0.base_35|) (= 0 v_~x$r_buff0_thd3~0_139) (= 0 |v_ULTIMATE.start_main_~#t666~0.offset_25|) (= 0 v_~x$w_buff1_used~0_545))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t668~0.base=|v_ULTIMATE.start_main_~#t668~0.base_35|, ULTIMATE.start_main_~#t668~0.offset=|v_ULTIMATE.start_main_~#t668~0.offset_25|, ~x$w_buff0~0=v_~x$w_buff0~0_341, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_359, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_139, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_66, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_66, ~x$w_buff1~0=v_~x$w_buff1~0_257, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_545, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_191, ULTIMATE.start_main_~#t667~0.offset=|v_ULTIMATE.start_main_~#t667~0.offset_25|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_31, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_~#t666~0.offset=|v_ULTIMATE.start_main_~#t666~0.offset_25|, ~x~0=v_~x~0_215, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_355, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_104|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_194, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~x$mem_tmp~0=v_~x$mem_tmp~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_49|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_66|, ~y~0=v_~y~0_194, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_23|, ULTIMATE.start_main_~#t667~0.base=|v_ULTIMATE.start_main_~#t667~0.base_35|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_45, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_248, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_48|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t666~0.base=|v_ULTIMATE.start_main_~#t666~0.base_35|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_11|, ~z~0=v_~z~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_179, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t668~0.base, ULTIMATE.start_main_~#t668~0.offset, ~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t667~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t666~0.offset, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t667~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t666~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 16:54:57,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L821-1-->L823: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t667~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t667~0.base_13|) |v_ULTIMATE.start_main_~#t667~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t667~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t667~0.base_13| 4)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t667~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t667~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t667~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t667~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t667~0.base=|v_ULTIMATE.start_main_~#t667~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t667~0.offset=|v_ULTIMATE.start_main_~#t667~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t667~0.base, #length, ULTIMATE.start_main_~#t667~0.offset] because there is no mapped edge [2019-12-18 16:54:57,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L823-1-->L825: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t668~0.base_12|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t668~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t668~0.offset_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t668~0.base_12| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t668~0.base_12|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t668~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t668~0.base_12|) |v_ULTIMATE.start_main_~#t668~0.offset_10| 2))) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t668~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t668~0.base=|v_ULTIMATE.start_main_~#t668~0.base_12|, ULTIMATE.start_main_~#t668~0.offset=|v_ULTIMATE.start_main_~#t668~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t668~0.base, ULTIMATE.start_main_~#t668~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 16:54:57,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= 0 (mod v_~x$w_buff1_used~0_57 256)) (= 1 v_~x$w_buff0_used~0_107) (= v_~x$w_buff1_used~0_57 v_~x$w_buff0_used~0_108) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_25) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= 1 v_~x$w_buff0~0_34) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_13, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~x$w_buff1~0=v_~x$w_buff1~0_25, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 16:54:57,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L798-2-->L798-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1021128080 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1021128080 256)))) (or (and (= ~x$w_buff1~0_In-1021128080 |P2Thread1of1ForFork1_#t~ite32_Out-1021128080|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-1021128080| ~x~0_In-1021128080)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1021128080, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1021128080, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1021128080, ~x~0=~x~0_In-1021128080} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1021128080|, ~x$w_buff1~0=~x$w_buff1~0_In-1021128080, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1021128080, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1021128080, ~x~0=~x~0_In-1021128080} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 16:54:57,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L798-4-->L799: Formula: (= v_~x~0_55 |v_P2Thread1of1ForFork1_#t~ite32_24|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_24|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_23|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_55} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 16:54:57,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In973607605 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In973607605 256)))) (or (and (= ~x$w_buff0_used~0_In973607605 |P2Thread1of1ForFork1_#t~ite34_Out973607605|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out973607605| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In973607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In973607605} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out973607605|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In973607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In973607605} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 16:54:57,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In8787028 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In8787028 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out8787028|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In8787028 |P1Thread1of1ForFork0_#t~ite28_Out8787028|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In8787028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In8787028} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In8787028, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out8787028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In8787028} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 16:54:57,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In2115237606 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2115237606 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2115237606 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2115237606 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out2115237606| ~x$w_buff1_used~0_In2115237606) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out2115237606| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2115237606, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2115237606, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2115237606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115237606} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2115237606, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2115237606, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2115237606, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2115237606|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115237606} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:54:57,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2120859754 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out2120859754| ~x$w_buff0~0_In2120859754) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In2120859754 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In2120859754 256) 0) .cse0) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In2120859754 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In2120859754 256)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite8_Out2120859754| |P0Thread1of1ForFork2_#t~ite9_Out2120859754|)) (and (not .cse1) (= ~x$w_buff0~0_In2120859754 |P0Thread1of1ForFork2_#t~ite9_Out2120859754|) (= |P0Thread1of1ForFork2_#t~ite8_In2120859754| |P0Thread1of1ForFork2_#t~ite8_Out2120859754|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2120859754, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2120859754, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In2120859754|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2120859754, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2120859754, ~weak$$choice2~0=~weak$$choice2~0_In2120859754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120859754} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2120859754, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2120859754, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out2120859754|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2120859754, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out2120859754|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2120859754, ~weak$$choice2~0=~weak$$choice2~0_In2120859754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120859754} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 16:54:57,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In257542034 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In257542034 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out257542034) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In257542034 ~x$r_buff0_thd2~0_Out257542034) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In257542034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In257542034} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out257542034|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out257542034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In257542034} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:54:57,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-505175775 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-505175775 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-505175775 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-505175775 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-505175775| ~x$r_buff1_thd2~0_In-505175775) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-505175775|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-505175775, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-505175775, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-505175775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-505175775} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-505175775|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-505175775, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-505175775, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-505175775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-505175775} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:54:57,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_34 (+ v_~__unbuffered_cnt~0_35 1)) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_40 |v_P1Thread1of1ForFork0_#t~ite31_26|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_25|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 16:54:57,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1493213808 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out1493213808| |P0Thread1of1ForFork2_#t~ite18_Out1493213808|) .cse0 (= ~x$w_buff1_used~0_In1493213808 |P0Thread1of1ForFork2_#t~ite17_Out1493213808|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1493213808 256)))) (or (and (= (mod ~x$w_buff1_used~0_In1493213808 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In1493213808 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In1493213808 256) 0)))) (and (= ~x$w_buff1_used~0_In1493213808 |P0Thread1of1ForFork2_#t~ite18_Out1493213808|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1493213808| |P0Thread1of1ForFork2_#t~ite17_Out1493213808|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1493213808, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1493213808|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1493213808, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1493213808, ~weak$$choice2~0=~weak$$choice2~0_In1493213808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1493213808} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1493213808, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1493213808|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1493213808|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1493213808, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1493213808, ~weak$$choice2~0=~weak$$choice2~0_In1493213808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1493213808} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 16:54:57,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L744-->L745: Formula: (and (not (= (mod v_~weak$$choice2~0_45 256) 0)) (= v_~x$r_buff0_thd1~0_116 v_~x$r_buff0_thd1~0_115)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_45} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_45, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 16:54:57,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1149647963 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1149647963 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1149647963 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1149647963 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1149647963 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite24_Out-1149647963| |P0Thread1of1ForFork2_#t~ite23_Out-1149647963|) (= ~x$r_buff1_thd1~0_In-1149647963 |P0Thread1of1ForFork2_#t~ite23_Out-1149647963|) .cse1) (and (not .cse1) (= ~x$r_buff1_thd1~0_In-1149647963 |P0Thread1of1ForFork2_#t~ite24_Out-1149647963|) (= |P0Thread1of1ForFork2_#t~ite23_In-1149647963| |P0Thread1of1ForFork2_#t~ite23_Out-1149647963|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1149647963, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1149647963, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1149647963, ~weak$$choice2~0=~weak$$choice2~0_In-1149647963, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1149647963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1149647963} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1149647963, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1149647963, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1149647963, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1149647963|, ~weak$$choice2~0=~weak$$choice2~0_In-1149647963, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1149647963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1149647963} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 16:54:57,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= v_~x$mem_tmp~0_7 v_~x~0_28) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (not (= 0 (mod v_~x$flush_delayed~0_10 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 16:54:57,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-376520527 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-376520527 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-376520527 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-376520527 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-376520527|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-376520527 |P2Thread1of1ForFork1_#t~ite35_Out-376520527|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-376520527, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-376520527, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-376520527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376520527} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-376520527|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-376520527, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-376520527, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-376520527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376520527} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 16:54:57,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-858104672 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-858104672 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In-858104672 |P2Thread1of1ForFork1_#t~ite36_Out-858104672|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-858104672|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-858104672, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-858104672} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-858104672|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-858104672, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-858104672} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 16:54:57,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1670515168 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1670515168 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1670515168 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1670515168 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1670515168|)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1670515168| ~x$r_buff1_thd3~0_In1670515168) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1670515168, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1670515168, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1670515168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1670515168} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1670515168|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1670515168, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1670515168, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1670515168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1670515168} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 16:54:57,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L802-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite37_30| v_~x$r_buff1_thd3~0_133) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1))) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_133, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 16:54:57,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L829-->L831-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= (mod v_~x$r_buff0_thd0~0_28 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:54:57,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-2-->L831-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2117284021 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2117284021 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-2117284021| ~x~0_In-2117284021)) (and (not .cse0) (= ~x$w_buff1~0_In-2117284021 |ULTIMATE.start_main_#t~ite41_Out-2117284021|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2117284021, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2117284021, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2117284021, ~x~0=~x~0_In-2117284021} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2117284021|, ~x$w_buff1~0=~x$w_buff1~0_In-2117284021, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2117284021, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2117284021, ~x~0=~x~0_In-2117284021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 16:54:57,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L831-4-->L832: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 16:54:57,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1277643398 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1277643398 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1277643398|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out1277643398| ~x$w_buff0_used~0_In1277643398) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1277643398, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1277643398} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1277643398, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1277643398|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1277643398} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 16:54:57,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L833-->L833-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1448397898 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1448397898 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1448397898 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1448397898 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1448397898| 0)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1448397898 |ULTIMATE.start_main_#t~ite44_Out1448397898|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1448397898, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1448397898, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1448397898, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1448397898} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1448397898, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1448397898, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1448397898, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1448397898|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1448397898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:54:57,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1806322828 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1806322828 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1806322828| ~x$r_buff0_thd0~0_In1806322828) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1806322828|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1806322828, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806322828} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1806322828, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1806322828|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806322828} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:54:57,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-->L835-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In631941012 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In631941012 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In631941012 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In631941012 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out631941012|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In631941012 |ULTIMATE.start_main_#t~ite46_Out631941012|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In631941012, ~x$w_buff1_used~0=~x$w_buff1_used~0_In631941012, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In631941012, ~x$w_buff0_used~0=~x$w_buff0_used~0_In631941012} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In631941012, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out631941012|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In631941012, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In631941012, ~x$w_buff0_used~0=~x$w_buff0_used~0_In631941012} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:54:57,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L835-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_177 |v_ULTIMATE.start_main_#t~ite46_58|) (= v_~__unbuffered_p2_EBX~0_32 0) (= 2 v_~__unbuffered_p2_EAX~0_32) (= v_~main$tmp_guard1~0_25 0) (= v_~y~0_146 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_18| (mod v_~main$tmp_guard1~0_25 256)) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~y~0=v_~y~0_146} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~y~0=v_~y~0_146, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_18|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:54:58,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:54:58 BasicIcfg [2019-12-18 16:54:58,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:54:58,075 INFO L168 Benchmark]: Toolchain (without parser) took 190519.19 ms. Allocated memory was 139.5 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 102.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 855.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:54:58,076 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.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 16:54:58,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.35 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 155.9 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:54:58,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.04 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:54:58,077 INFO L168 Benchmark]: Boogie Preprocessor took 37.25 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:54:58,078 INFO L168 Benchmark]: RCFGBuilder took 830.12 ms. Allocated memory is still 203.9 MB. Free memory was 150.5 MB in the beginning and 103.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:54:58,078 INFO L168 Benchmark]: TraceAbstraction took 188811.95 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 792.4 MB. Max. memory is 7.1 GB. [2019-12-18 16:54:58,081 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.18 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.35 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 155.9 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.04 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.25 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.12 ms. Allocated memory is still 203.9 MB. Free memory was 150.5 MB in the beginning and 103.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188811.95 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 792.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6794 VarBasedMoverChecksPositive, 260 VarBasedMoverChecksNegative, 81 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 73051 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L825] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 y = 2 [L792] 3 __unbuffered_p2_EAX = y [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L732] 1 z = 1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 188.5s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 66.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4380 SDtfs, 5605 SDslu, 11823 SDs, 0 SdLazy, 8699 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 35 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173869occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 102.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 204046 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 824 ConstructedInterpolants, 0 QuantifiedInterpolants, 138334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...