/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/mix043_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:27:44,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:27:44,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:27:44,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:27:44,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:27:44,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:27:44,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:27:44,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:27:44,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:27:44,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:27:44,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:27:44,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:27:44,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:27:44,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:27:44,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:27:44,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:27:44,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:27:44,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:27:44,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:27:44,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:27:44,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:27:44,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:27:44,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:27:44,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:27:44,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:27:44,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:27:44,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:27:44,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:27:44,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:27:44,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:27:44,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:27:44,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:27:44,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:27:44,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:27:44,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:27:44,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:27:44,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:27:44,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:27:44,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:27:44,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:27:44,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:27:44,373 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 17:27:44,387 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:27:44,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:27:44,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:27:44,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:27:44,389 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:27:44,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:27:44,390 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:27:44,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:27:44,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:27:44,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:27:44,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:27:44,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:27:44,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:27:44,391 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:27:44,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:27:44,392 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:27:44,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:27:44,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:27:44,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:27:44,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:27:44,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:27:44,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:27:44,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:27:44,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:27:44,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:27:44,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:27:44,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:27:44,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:27:44,394 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:27:44,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:27:44,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:27:44,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:27:44,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:27:44,666 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:27:44,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i [2019-12-18 17:27:44,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84a486da/8973457ad96f4a74b53119770f54bfc9/FLAG35cd2c91e [2019-12-18 17:27:45,330 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:27:45,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i [2019-12-18 17:27:45,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84a486da/8973457ad96f4a74b53119770f54bfc9/FLAG35cd2c91e [2019-12-18 17:27:45,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84a486da/8973457ad96f4a74b53119770f54bfc9 [2019-12-18 17:27:45,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:27:45,571 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:27:45,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:27:45,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:27:45,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:27:45,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:27:45" (1/1) ... [2019-12-18 17:27:45,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259267b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:45, skipping insertion in model container [2019-12-18 17:27:45,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:27:45" (1/1) ... [2019-12-18 17:27:45,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:27:45,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:27:46,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:27:46,195 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:27:46,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:27:46,365 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:27:46,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46 WrapperNode [2019-12-18 17:27:46,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:27:46,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:27:46,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:27:46,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:27:46,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (1/1) ... [2019-12-18 17:27:46,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (1/1) ... [2019-12-18 17:27:46,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:27:46,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:27:46,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:27:46,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:27:46,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (1/1) ... [2019-12-18 17:27:46,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (1/1) ... [2019-12-18 17:27:46,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (1/1) ... [2019-12-18 17:27:46,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (1/1) ... [2019-12-18 17:27:46,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (1/1) ... [2019-12-18 17:27:46,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (1/1) ... [2019-12-18 17:27:46,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (1/1) ... [2019-12-18 17:27:46,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:27:46,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:27:46,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:27:46,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:27:46,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (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 17:27:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:27:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:27:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:27:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:27:46,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:27:46,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:27:46,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:27:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:27:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:27:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:27:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:27:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:27:46,535 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 17:27:47,258 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:27:47,258 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:27:47,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:27:47 BoogieIcfgContainer [2019-12-18 17:27:47,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:27:47,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:27:47,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:27:47,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:27:47,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:27:45" (1/3) ... [2019-12-18 17:27:47,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab9d69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:27:47, skipping insertion in model container [2019-12-18 17:27:47,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:46" (2/3) ... [2019-12-18 17:27:47,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab9d69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:27:47, skipping insertion in model container [2019-12-18 17:27:47,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:27:47" (3/3) ... [2019-12-18 17:27:47,269 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_power.opt.i [2019-12-18 17:27:47,280 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:27:47,280 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:27:47,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:27:47,292 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:27:47,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,331 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,333 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,335 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,336 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,344 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,344 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,345 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,345 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,345 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,345 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,346 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,346 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,346 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,348 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,348 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,348 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,348 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,348 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,364 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,365 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,369 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,369 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,388 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:47,403 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:27:47,424 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:27:47,424 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:27:47,424 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:27:47,424 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:27:47,424 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:27:47,424 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:27:47,425 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:27:47,425 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:27:47,442 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 17:27:47,444 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 17:27:47,532 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 17:27:47,535 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:27:47,556 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:27:47,578 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 17:27:47,653 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 17:27:47,653 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:27:47,662 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:27:47,680 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:27:47,681 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:27:53,090 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 17:27:53,220 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 17:27:53,246 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-18 17:27:53,246 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-18 17:27:53,250 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 17:27:55,367 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-18 17:27:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-18 17:27:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:27:55,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:55,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:55,376 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:55,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:55,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-18 17:27:55,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:55,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949772145] [2019-12-18 17:27:55,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:55,680 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 17:27:55,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949772145] [2019-12-18 17:27:55,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:55,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:27:55,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199151259] [2019-12-18 17:27:55,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:55,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:55,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:55,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:55,706 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-18 17:27:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:57,175 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-18 17:27:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:57,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:27:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:57,434 INFO L225 Difference]: With dead ends: 33638 [2019-12-18 17:27:57,434 INFO L226 Difference]: Without dead ends: 32966 [2019-12-18 17:27:57,435 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 17:27:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-18 17:27:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-18 17:27:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-18 17:27:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-18 17:27:59,195 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-18 17:27:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:59,196 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-18 17:27:59,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-18 17:28:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:28:00,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:00,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:28:00,425 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-18 17:28:00,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:00,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099807182] [2019-12-18 17:28:00,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:00,554 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 17:28:00,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099807182] [2019-12-18 17:28:00,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:00,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:00,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091037720] [2019-12-18 17:28:00,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:28:00,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:00,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:28:00,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:28:00,560 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-18 17:28:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:01,045 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-18 17:28:01,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:28:01,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:28:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:01,281 INFO L225 Difference]: With dead ends: 44494 [2019-12-18 17:28:01,282 INFO L226 Difference]: Without dead ends: 44494 [2019-12-18 17:28:01,283 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 17:28:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-18 17:28:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-18 17:28:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-18 17:28:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-18 17:28:05,378 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-18 17:28:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:05,379 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-18 17:28:05,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:28:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-18 17:28:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:28:05,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:05,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:28:05,383 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-18 17:28:05,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:05,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204977736] [2019-12-18 17:28:05,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:05,463 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 17:28:05,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204977736] [2019-12-18 17:28:05,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:05,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:05,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712326026] [2019-12-18 17:28:05,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:28:05,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:05,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:28:05,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:28:05,466 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-18 17:28:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:06,009 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-18 17:28:06,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:28:06,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:28:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:06,238 INFO L225 Difference]: With dead ends: 62082 [2019-12-18 17:28:06,239 INFO L226 Difference]: Without dead ends: 62054 [2019-12-18 17:28:06,239 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 17:28:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-18 17:28:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-18 17:28:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-18 17:28:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-18 17:28:08,741 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-18 17:28:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:08,741 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-18 17:28:08,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:28:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-18 17:28:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:28:08,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:08,757 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] [2019-12-18 17:28:08,758 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:08,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-18 17:28:08,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:08,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535750256] [2019-12-18 17:28:08,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:08,872 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 17:28:08,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535750256] [2019-12-18 17:28:08,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:08,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:28:08,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150733836] [2019-12-18 17:28:08,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:28:08,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:08,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:28:08,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:28:08,875 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-18 17:28:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:09,625 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-18 17:28:09,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:28:09,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 17:28:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:12,199 INFO L225 Difference]: With dead ends: 68854 [2019-12-18 17:28:12,199 INFO L226 Difference]: Without dead ends: 68826 [2019-12-18 17:28:12,200 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 17:28:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-18 17:28:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-18 17:28:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-18 17:28:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-18 17:28:13,613 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-18 17:28:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:13,613 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-18 17:28:13,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:28:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-18 17:28:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:28:13,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:13,660 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 17:28:13,660 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:13,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-18 17:28:13,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:13,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843636578] [2019-12-18 17:28:13,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:13,726 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 17:28:13,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843636578] [2019-12-18 17:28:13,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:13,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:28:13,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770743057] [2019-12-18 17:28:13,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:28:13,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:13,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:28:13,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:13,729 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-18 17:28:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:14,070 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-18 17:28:14,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:28:14,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 17:28:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:14,834 INFO L225 Difference]: With dead ends: 64130 [2019-12-18 17:28:14,834 INFO L226 Difference]: Without dead ends: 64130 [2019-12-18 17:28:14,834 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 17:28:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-18 17:28:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-18 17:28:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-18 17:28:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-18 17:28:18,984 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-18 17:28:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:18,984 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-18 17:28:18,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:28:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-18 17:28:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:28:19,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:19,018 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 17:28:19,018 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:19,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-18 17:28:19,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:19,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256361931] [2019-12-18 17:28:19,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:19,156 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 17:28:19,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256361931] [2019-12-18 17:28:19,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:19,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:28:19,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400248906] [2019-12-18 17:28:19,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:28:19,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:19,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:28:19,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:28:19,159 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-18 17:28:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:19,851 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-18 17:28:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:28:19,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:28:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:20,610 INFO L225 Difference]: With dead ends: 81602 [2019-12-18 17:28:20,610 INFO L226 Difference]: Without dead ends: 81538 [2019-12-18 17:28:20,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:28:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-18 17:28:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-18 17:28:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 17:28:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-18 17:28:24,961 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-18 17:28:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:24,962 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-18 17:28:24,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:28:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-18 17:28:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:28:25,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:25,036 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] [2019-12-18 17:28:25,037 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:25,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-18 17:28:25,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:25,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526502320] [2019-12-18 17:28:25,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:25,142 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 17:28:25,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526502320] [2019-12-18 17:28:25,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:25,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:25,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851843007] [2019-12-18 17:28:25,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:28:25,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:28:25,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:25,144 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-18 17:28:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:25,541 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-18 17:28:25,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:28:25,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-18 17:28:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:25,712 INFO L225 Difference]: With dead ends: 65578 [2019-12-18 17:28:25,712 INFO L226 Difference]: Without dead ends: 65578 [2019-12-18 17:28:25,712 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 17:28:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-18 17:28:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-18 17:28:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 17:28:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-18 17:28:28,356 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-18 17:28:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:28,356 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-18 17:28:28,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:28:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-18 17:28:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:28:28,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:28,417 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] [2019-12-18 17:28:28,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-18 17:28:28,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:28,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849418309] [2019-12-18 17:28:28,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:28,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 17:28:28,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849418309] [2019-12-18 17:28:28,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:28,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:28:28,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055980564] [2019-12-18 17:28:28,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:28:28,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:28:28,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:28:28,638 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 9 states. [2019-12-18 17:28:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:30,307 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-18 17:28:30,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:28:30,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-18 17:28:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:30,535 INFO L225 Difference]: With dead ends: 89414 [2019-12-18 17:28:30,536 INFO L226 Difference]: Without dead ends: 89310 [2019-12-18 17:28:30,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:28:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-18 17:28:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-18 17:28:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-18 17:28:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-18 17:28:35,351 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-18 17:28:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:35,352 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-18 17:28:35,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:28:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-18 17:28:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:28:35,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:28:35,426 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-18 17:28:35,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:35,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806397570] [2019-12-18 17:28:35,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:35,511 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 17:28:35,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806397570] [2019-12-18 17:28:35,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:35,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:28:35,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305867279] [2019-12-18 17:28:35,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:28:35,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:28:35,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:28:35,514 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 4 states. [2019-12-18 17:28:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:36,314 INFO L93 Difference]: Finished difference Result 47360 states and 179978 transitions. [2019-12-18 17:28:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:28:36,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-18 17:28:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:36,422 INFO L225 Difference]: With dead ends: 47360 [2019-12-18 17:28:36,423 INFO L226 Difference]: Without dead ends: 46252 [2019-12-18 17:28:36,423 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 17:28:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46252 states. [2019-12-18 17:28:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46252 to 46252. [2019-12-18 17:28:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46252 states. [2019-12-18 17:28:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46252 states to 46252 states and 176502 transitions. [2019-12-18 17:28:37,296 INFO L78 Accepts]: Start accepts. Automaton has 46252 states and 176502 transitions. Word has length 35 [2019-12-18 17:28:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:37,296 INFO L462 AbstractCegarLoop]: Abstraction has 46252 states and 176502 transitions. [2019-12-18 17:28:37,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:28:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 46252 states and 176502 transitions. [2019-12-18 17:28:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 17:28:37,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:37,335 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] [2019-12-18 17:28:37,336 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1617947594, now seen corresponding path program 1 times [2019-12-18 17:28:37,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:37,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011738686] [2019-12-18 17:28:37,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:37,413 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 17:28:37,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011738686] [2019-12-18 17:28:37,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:37,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:28:37,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66187748] [2019-12-18 17:28:37,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:28:37,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:28:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:28:37,416 INFO L87 Difference]: Start difference. First operand 46252 states and 176502 transitions. Second operand 5 states. [2019-12-18 17:28:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:37,550 INFO L93 Difference]: Finished difference Result 20151 states and 63661 transitions. [2019-12-18 17:28:37,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:28:37,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-18 17:28:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:37,599 INFO L225 Difference]: With dead ends: 20151 [2019-12-18 17:28:37,599 INFO L226 Difference]: Without dead ends: 19275 [2019-12-18 17:28:37,600 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 17:28:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19275 states. [2019-12-18 17:28:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19275 to 19275. [2019-12-18 17:28:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19275 states. [2019-12-18 17:28:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19275 states to 19275 states and 60863 transitions. [2019-12-18 17:28:39,887 INFO L78 Accepts]: Start accepts. Automaton has 19275 states and 60863 transitions. Word has length 36 [2019-12-18 17:28:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:39,887 INFO L462 AbstractCegarLoop]: Abstraction has 19275 states and 60863 transitions. [2019-12-18 17:28:39,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:28:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 19275 states and 60863 transitions. [2019-12-18 17:28:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 17:28:39,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:39,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:28:39,900 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:39,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1645824889, now seen corresponding path program 1 times [2019-12-18 17:28:39,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:39,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978121587] [2019-12-18 17:28:39,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:40,035 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 17:28:40,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978121587] [2019-12-18 17:28:40,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:40,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:28:40,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16404493] [2019-12-18 17:28:40,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:28:40,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:40,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:28:40,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:28:40,038 INFO L87 Difference]: Start difference. First operand 19275 states and 60863 transitions. Second operand 6 states. [2019-12-18 17:28:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:40,381 INFO L93 Difference]: Finished difference Result 23822 states and 75940 transitions. [2019-12-18 17:28:40,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:28:40,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-18 17:28:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:40,434 INFO L225 Difference]: With dead ends: 23822 [2019-12-18 17:28:40,434 INFO L226 Difference]: Without dead ends: 22824 [2019-12-18 17:28:40,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:28:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22824 states. [2019-12-18 17:28:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22824 to 21264. [2019-12-18 17:28:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21264 states. [2019-12-18 17:28:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21264 states to 21264 states and 67572 transitions. [2019-12-18 17:28:40,852 INFO L78 Accepts]: Start accepts. Automaton has 21264 states and 67572 transitions. Word has length 37 [2019-12-18 17:28:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:40,853 INFO L462 AbstractCegarLoop]: Abstraction has 21264 states and 67572 transitions. [2019-12-18 17:28:40,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:28:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 21264 states and 67572 transitions. [2019-12-18 17:28:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:28:40,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:40,870 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] [2019-12-18 17:28:40,870 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1508152385, now seen corresponding path program 1 times [2019-12-18 17:28:40,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:40,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21459611] [2019-12-18 17:28:40,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:41,016 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 17:28:41,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21459611] [2019-12-18 17:28:41,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:41,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:28:41,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349248541] [2019-12-18 17:28:41,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:28:41,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:28:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:28:41,019 INFO L87 Difference]: Start difference. First operand 21264 states and 67572 transitions. Second operand 7 states. [2019-12-18 17:28:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:41,382 INFO L93 Difference]: Finished difference Result 36395 states and 116077 transitions. [2019-12-18 17:28:41,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:28:41,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-18 17:28:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:41,424 INFO L225 Difference]: With dead ends: 36395 [2019-12-18 17:28:41,424 INFO L226 Difference]: Without dead ends: 17493 [2019-12-18 17:28:41,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:28:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17493 states. [2019-12-18 17:28:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17493 to 16368. [2019-12-18 17:28:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16368 states. [2019-12-18 17:28:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16368 states to 16368 states and 52247 transitions. [2019-12-18 17:28:41,721 INFO L78 Accepts]: Start accepts. Automaton has 16368 states and 52247 transitions. Word has length 39 [2019-12-18 17:28:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:41,721 INFO L462 AbstractCegarLoop]: Abstraction has 16368 states and 52247 transitions. [2019-12-18 17:28:41,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:28:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 16368 states and 52247 transitions. [2019-12-18 17:28:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:28:41,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:41,734 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] [2019-12-18 17:28:41,734 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:41,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2053204377, now seen corresponding path program 2 times [2019-12-18 17:28:41,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:41,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945881841] [2019-12-18 17:28:41,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:41,851 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 17:28:41,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945881841] [2019-12-18 17:28:41,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:41,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:28:41,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066072873] [2019-12-18 17:28:41,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:28:41,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:41,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:28:41,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:28:41,854 INFO L87 Difference]: Start difference. First operand 16368 states and 52247 transitions. Second operand 9 states. [2019-12-18 17:28:42,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:42,253 INFO L93 Difference]: Finished difference Result 23869 states and 76577 transitions. [2019-12-18 17:28:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:28:42,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-18 17:28:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:42,284 INFO L225 Difference]: With dead ends: 23869 [2019-12-18 17:28:42,284 INFO L226 Difference]: Without dead ends: 20801 [2019-12-18 17:28:42,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:28:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20801 states. [2019-12-18 17:28:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20801 to 19100. [2019-12-18 17:28:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19100 states. [2019-12-18 17:28:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19100 states to 19100 states and 60950 transitions. [2019-12-18 17:28:42,825 INFO L78 Accepts]: Start accepts. Automaton has 19100 states and 60950 transitions. Word has length 39 [2019-12-18 17:28:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:42,826 INFO L462 AbstractCegarLoop]: Abstraction has 19100 states and 60950 transitions. [2019-12-18 17:28:42,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:28:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 19100 states and 60950 transitions. [2019-12-18 17:28:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:28:42,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:42,840 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 17:28:42,840 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1961307543, now seen corresponding path program 1 times [2019-12-18 17:28:42,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:42,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180870364] [2019-12-18 17:28:42,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:42,922 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 17:28:42,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180870364] [2019-12-18 17:28:42,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:42,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:28:42,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94539942] [2019-12-18 17:28:42,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:28:42,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:28:42,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:28:42,925 INFO L87 Difference]: Start difference. First operand 19100 states and 60950 transitions. Second operand 6 states. [2019-12-18 17:28:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:43,008 INFO L93 Difference]: Finished difference Result 3342 states and 8386 transitions. [2019-12-18 17:28:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:28:43,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 17:28:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:43,013 INFO L225 Difference]: With dead ends: 3342 [2019-12-18 17:28:43,013 INFO L226 Difference]: Without dead ends: 3011 [2019-12-18 17:28:43,014 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 17:28:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2019-12-18 17:28:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 3011. [2019-12-18 17:28:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3011 states. [2019-12-18 17:28:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 7460 transitions. [2019-12-18 17:28:43,059 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 7460 transitions. Word has length 40 [2019-12-18 17:28:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:43,061 INFO L462 AbstractCegarLoop]: Abstraction has 3011 states and 7460 transitions. [2019-12-18 17:28:43,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:28:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 7460 transitions. [2019-12-18 17:28:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:28:43,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:43,064 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] [2019-12-18 17:28:43,065 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-18 17:28:43,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:43,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534902849] [2019-12-18 17:28:43,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:43,174 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 17:28:43,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534902849] [2019-12-18 17:28:43,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:43,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:28:43,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280505308] [2019-12-18 17:28:43,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:28:43,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:28:43,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:28:43,176 INFO L87 Difference]: Start difference. First operand 3011 states and 7460 transitions. Second operand 7 states. [2019-12-18 17:28:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:43,269 INFO L93 Difference]: Finished difference Result 1216 states and 3318 transitions. [2019-12-18 17:28:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:28:43,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 17:28:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:43,271 INFO L225 Difference]: With dead ends: 1216 [2019-12-18 17:28:43,271 INFO L226 Difference]: Without dead ends: 1170 [2019-12-18 17:28:43,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:28:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-18 17:28:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1058. [2019-12-18 17:28:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-18 17:28:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2908 transitions. [2019-12-18 17:28:43,286 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2908 transitions. Word has length 48 [2019-12-18 17:28:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:43,286 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2908 transitions. [2019-12-18 17:28:43,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:28:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2908 transitions. [2019-12-18 17:28:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:28:43,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:43,288 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, 1, 1, 1] [2019-12-18 17:28:43,288 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:43,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:43,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-18 17:28:43,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:43,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990875610] [2019-12-18 17:28:43,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:43,551 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 17:28:43,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990875610] [2019-12-18 17:28:43,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:43,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:28:43,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598459133] [2019-12-18 17:28:43,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:28:43,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:43,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:28:43,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:28:43,556 INFO L87 Difference]: Start difference. First operand 1058 states and 2908 transitions. Second operand 13 states. [2019-12-18 17:28:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:44,488 INFO L93 Difference]: Finished difference Result 2067 states and 5525 transitions. [2019-12-18 17:28:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:28:44,489 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-18 17:28:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:44,492 INFO L225 Difference]: With dead ends: 2067 [2019-12-18 17:28:44,492 INFO L226 Difference]: Without dead ends: 1639 [2019-12-18 17:28:44,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-12-18 17:28:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-12-18 17:28:44,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1102. [2019-12-18 17:28:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-18 17:28:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 3030 transitions. [2019-12-18 17:28:44,509 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 3030 transitions. Word has length 59 [2019-12-18 17:28:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:44,509 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 3030 transitions. [2019-12-18 17:28:44,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:28:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 3030 transitions. [2019-12-18 17:28:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:28:44,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:44,511 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, 1, 1, 1] [2019-12-18 17:28:44,511 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:44,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:44,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2035601323, now seen corresponding path program 2 times [2019-12-18 17:28:44,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:44,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100383873] [2019-12-18 17:28:44,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:44,755 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 17:28:44,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100383873] [2019-12-18 17:28:44,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:44,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:28:44,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427930925] [2019-12-18 17:28:44,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:28:44,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:44,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:28:44,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:28:44,757 INFO L87 Difference]: Start difference. First operand 1102 states and 3030 transitions. Second operand 13 states. [2019-12-18 17:28:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:46,107 INFO L93 Difference]: Finished difference Result 2560 states and 6711 transitions. [2019-12-18 17:28:46,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:28:46,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-18 17:28:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:46,112 INFO L225 Difference]: With dead ends: 2560 [2019-12-18 17:28:46,112 INFO L226 Difference]: Without dead ends: 2060 [2019-12-18 17:28:46,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2019-12-18 17:28:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2019-12-18 17:28:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1180. [2019-12-18 17:28:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-18 17:28:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3213 transitions. [2019-12-18 17:28:46,130 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3213 transitions. Word has length 59 [2019-12-18 17:28:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:46,130 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3213 transitions. [2019-12-18 17:28:46,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:28:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3213 transitions. [2019-12-18 17:28:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:28:46,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:46,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:28:46,132 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash 391383943, now seen corresponding path program 3 times [2019-12-18 17:28:46,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:46,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253515812] [2019-12-18 17:28:46,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:46,467 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 17:28:46,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253515812] [2019-12-18 17:28:46,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:46,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:28:46,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600007615] [2019-12-18 17:28:46,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 17:28:46,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:46,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 17:28:46,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:28:46,469 INFO L87 Difference]: Start difference. First operand 1180 states and 3213 transitions. Second operand 14 states. [2019-12-18 17:28:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:48,107 INFO L93 Difference]: Finished difference Result 2766 states and 7236 transitions. [2019-12-18 17:28:48,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 17:28:48,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-12-18 17:28:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:48,112 INFO L225 Difference]: With dead ends: 2766 [2019-12-18 17:28:48,112 INFO L226 Difference]: Without dead ends: 2040 [2019-12-18 17:28:48,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 17:28:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2019-12-18 17:28:48,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1286. [2019-12-18 17:28:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-18 17:28:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 3464 transitions. [2019-12-18 17:28:48,131 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 3464 transitions. Word has length 59 [2019-12-18 17:28:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:48,132 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 3464 transitions. [2019-12-18 17:28:48,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 17:28:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 3464 transitions. [2019-12-18 17:28:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:28:48,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:48,133 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, 1, 1, 1] [2019-12-18 17:28:48,133 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1484684469, now seen corresponding path program 4 times [2019-12-18 17:28:48,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:48,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240206936] [2019-12-18 17:28:48,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:48,352 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 17:28:48,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240206936] [2019-12-18 17:28:48,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:48,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:28:48,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476020604] [2019-12-18 17:28:48,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:28:48,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:48,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:28:48,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:28:48,354 INFO L87 Difference]: Start difference. First operand 1286 states and 3464 transitions. Second operand 12 states. [2019-12-18 17:28:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:49,637 INFO L93 Difference]: Finished difference Result 2953 states and 7493 transitions. [2019-12-18 17:28:49,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 17:28:49,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 17:28:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:49,640 INFO L225 Difference]: With dead ends: 2953 [2019-12-18 17:28:49,640 INFO L226 Difference]: Without dead ends: 1182 [2019-12-18 17:28:49,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 17:28:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2019-12-18 17:28:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 627. [2019-12-18 17:28:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-12-18 17:28:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1402 transitions. [2019-12-18 17:28:49,650 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 1402 transitions. Word has length 59 [2019-12-18 17:28:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:49,650 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 1402 transitions. [2019-12-18 17:28:49,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:28:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1402 transitions. [2019-12-18 17:28:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:28:49,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:49,651 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, 1, 1, 1] [2019-12-18 17:28:49,651 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:49,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1632162753, now seen corresponding path program 5 times [2019-12-18 17:28:49,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:49,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641116698] [2019-12-18 17:28:49,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:49,710 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 17:28:49,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641116698] [2019-12-18 17:28:49,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:49,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:49,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214768394] [2019-12-18 17:28:49,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:28:49,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:28:49,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:49,712 INFO L87 Difference]: Start difference. First operand 627 states and 1402 transitions. Second operand 3 states. [2019-12-18 17:28:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:49,733 INFO L93 Difference]: Finished difference Result 598 states and 1305 transitions. [2019-12-18 17:28:49,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:28:49,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:28:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:49,735 INFO L225 Difference]: With dead ends: 598 [2019-12-18 17:28:49,735 INFO L226 Difference]: Without dead ends: 598 [2019-12-18 17:28:49,735 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 17:28:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-12-18 17:28:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 572. [2019-12-18 17:28:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-18 17:28:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1242 transitions. [2019-12-18 17:28:49,742 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1242 transitions. Word has length 59 [2019-12-18 17:28:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:49,743 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1242 transitions. [2019-12-18 17:28:49,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:28:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1242 transitions. [2019-12-18 17:28:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:28:49,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:28:49,744 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 1 times [2019-12-18 17:28:49,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:49,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374441465] [2019-12-18 17:28:49,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:50,005 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 17:28:50,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374441465] [2019-12-18 17:28:50,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:50,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:28:50,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858834013] [2019-12-18 17:28:50,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:28:50,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:28:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:28:50,007 INFO L87 Difference]: Start difference. First operand 572 states and 1242 transitions. Second operand 13 states. [2019-12-18 17:28:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:50,332 INFO L93 Difference]: Finished difference Result 828 states and 1780 transitions. [2019-12-18 17:28:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:28:50,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:28:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:50,334 INFO L225 Difference]: With dead ends: 828 [2019-12-18 17:28:50,334 INFO L226 Difference]: Without dead ends: 794 [2019-12-18 17:28:50,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:28:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-12-18 17:28:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 776. [2019-12-18 17:28:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-12-18 17:28:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1695 transitions. [2019-12-18 17:28:50,343 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1695 transitions. Word has length 60 [2019-12-18 17:28:50,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:50,344 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1695 transitions. [2019-12-18 17:28:50,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:28:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1695 transitions. [2019-12-18 17:28:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:28:50,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:50,345 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, 1, 1, 1, 1] [2019-12-18 17:28:50,345 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:50,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:50,346 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 2 times [2019-12-18 17:28:50,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:50,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862707342] [2019-12-18 17:28:50,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:28:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:28:50,458 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:28:50,458 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:28:50,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1133~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1133~0.base_21|) |v_ULTIMATE.start_main_~#t1133~0.offset_16| 0)) |v_#memory_int_27|) (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= (select .cse0 |v_ULTIMATE.start_main_~#t1133~0.base_21|) 0) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_ULTIMATE.start_main_~#t1133~0.offset_16| 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_135 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1133~0.base_21| 4)) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1133~0.base_21| 1)) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1133~0.base_21|) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, ULTIMATE.start_main_~#t1134~0.offset=|v_ULTIMATE.start_main_~#t1134~0.offset_16|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ULTIMATE.start_main_~#t1136~0.base=|v_ULTIMATE.start_main_~#t1136~0.base_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ULTIMATE.start_main_~#t1133~0.base=|v_ULTIMATE.start_main_~#t1133~0.base_21|, ULTIMATE.start_main_~#t1134~0.base=|v_ULTIMATE.start_main_~#t1134~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_~#t1136~0.offset=|v_ULTIMATE.start_main_~#t1136~0.offset_16|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ULTIMATE.start_main_~#t1135~0.offset=|v_ULTIMATE.start_main_~#t1135~0.offset_16|, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ULTIMATE.start_main_~#t1135~0.base=|v_ULTIMATE.start_main_~#t1135~0.base_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ULTIMATE.start_main_~#t1133~0.offset=|v_ULTIMATE.start_main_~#t1133~0.offset_16|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1134~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1136~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1133~0.base, ULTIMATE.start_main_~#t1134~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1136~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1135~0.offset, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1135~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1133~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:28:50,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1134~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1134~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1134~0.base_12| 4)) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1134~0.base_12| 1) |v_#valid_44|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1134~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1134~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1134~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1134~0.base_12|) |v_ULTIMATE.start_main_~#t1134~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1134~0.base=|v_ULTIMATE.start_main_~#t1134~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t1134~0.offset=|v_ULTIMATE.start_main_~#t1134~0.offset_10|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1134~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1134~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 17:28:50,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1135~0.base_8|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1135~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1135~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1135~0.base_8|) |v_ULTIMATE.start_main_~#t1135~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1135~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1135~0.base_8| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1135~0.base_8| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1135~0.base_8|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ULTIMATE.start_main_~#t1135~0.base=|v_ULTIMATE.start_main_~#t1135~0.base_8|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1135~0.offset=|v_ULTIMATE.start_main_~#t1135~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1135~0.base, #length, ULTIMATE.start_main_~#t1135~0.offset] because there is no mapped edge [2019-12-18 17:28:50,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t1136~0.offset_10| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1136~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1136~0.base_12|) |v_ULTIMATE.start_main_~#t1136~0.offset_10| 3)) |v_#memory_int_23|) (not (= 0 |v_ULTIMATE.start_main_~#t1136~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1136~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1136~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1136~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1136~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1136~0.base=|v_ULTIMATE.start_main_~#t1136~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ULTIMATE.start_main_~#t1136~0.offset=|v_ULTIMATE.start_main_~#t1136~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1136~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1136~0.offset] because there is no mapped edge [2019-12-18 17:28:50,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~z$r_buff1_thd2~0_Out2099601924 ~z$r_buff0_thd2~0_In2099601924) (= ~z$r_buff0_thd4~0_In2099601924 ~z$r_buff1_thd4~0_Out2099601924) (= ~z$r_buff0_thd4~0_Out2099601924 1) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In2099601924 0)) (= ~z$r_buff1_thd3~0_Out2099601924 ~z$r_buff0_thd3~0_In2099601924) (= 1 ~a~0_Out2099601924) (= ~z$r_buff1_thd0~0_Out2099601924 ~z$r_buff0_thd0~0_In2099601924) (= ~__unbuffered_p3_EBX~0_Out2099601924 ~b~0_In2099601924) (= ~z$r_buff0_thd1~0_In2099601924 ~z$r_buff1_thd1~0_Out2099601924) (= ~__unbuffered_p3_EAX~0_Out2099601924 ~a~0_Out2099601924)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In2099601924, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2099601924, ~b~0=~b~0_In2099601924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2099601924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2099601924, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2099601924, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2099601924} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In2099601924, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out2099601924, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out2099601924, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out2099601924, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out2099601924, ~a~0=~a~0_Out2099601924, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2099601924, ~b~0=~b~0_In2099601924, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2099601924, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out2099601924, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out2099601924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2099601924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2099601924, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2099601924, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2099601924} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:28:50,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:28:50,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:28:50,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1943812722 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1943812722 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out1943812722| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out1943812722| ~z$w_buff0_used~0_In1943812722)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1943812722, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1943812722} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1943812722, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1943812722, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1943812722|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:28:50,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1575330614 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1575330614 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out1575330614| ~z$w_buff1~0_In1575330614)) (and (or .cse1 .cse0) (= ~z~0_In1575330614 |P2Thread1of1ForFork2_#t~ite3_Out1575330614|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1575330614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1575330614, ~z$w_buff1~0=~z$w_buff1~0_In1575330614, ~z~0=~z~0_In1575330614} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1575330614|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1575330614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1575330614, ~z$w_buff1~0=~z$w_buff1~0_In1575330614, ~z~0=~z~0_In1575330614} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:28:50,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:28:50,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2123866876 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2123866876 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out2123866876| ~z$w_buff0_used~0_In2123866876)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out2123866876| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2123866876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2123866876} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out2123866876|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2123866876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2123866876} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:28:50,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In88744127 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In88744127 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In88744127 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In88744127 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out88744127| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In88744127 |P2Thread1of1ForFork2_#t~ite6_Out88744127|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In88744127, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In88744127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In88744127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In88744127} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out88744127|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In88744127, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In88744127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In88744127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In88744127} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:28:50,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2054088150 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In2054088150 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out2054088150| ~z$r_buff0_thd3~0_In2054088150) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out2054088150|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2054088150, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2054088150} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2054088150, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2054088150, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2054088150|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:28:50,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1570475333 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1570475333 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1570475333 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1570475333 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In1570475333 |P2Thread1of1ForFork2_#t~ite8_Out1570475333|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out1570475333|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1570475333, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1570475333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570475333, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1570475333} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1570475333, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1570475333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570475333, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1570475333, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1570475333|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:28:50,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:28:50,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1099812024 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1099812024 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1099812024 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1099812024 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out-1099812024| 0)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite12_Out-1099812024| ~z$w_buff1_used~0_In-1099812024) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1099812024, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1099812024, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1099812024, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1099812024} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1099812024, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1099812024, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1099812024, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1099812024, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1099812024|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:28:50,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1553892027 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1553892027 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out1553892027 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out1553892027 ~z$r_buff0_thd4~0_In1553892027)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1553892027, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1553892027} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1553892027, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1553892027, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1553892027|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:28:50,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In-1732018045 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1732018045 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1732018045 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1732018045 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out-1732018045| 0)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out-1732018045| ~z$r_buff1_thd4~0_In-1732018045) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1732018045, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1732018045, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1732018045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1732018045} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1732018045, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1732018045, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1732018045|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1732018045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1732018045} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:28:50,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:28:50,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:28:50,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out2139187934| |ULTIMATE.start_main_#t~ite20_Out2139187934|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2139187934 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2139187934 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite19_Out2139187934| ~z$w_buff1~0_In2139187934)) (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite19_Out2139187934| ~z~0_In2139187934)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2139187934, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2139187934, ~z$w_buff1~0=~z$w_buff1~0_In2139187934, ~z~0=~z~0_In2139187934} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2139187934|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2139187934, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2139187934, ~z$w_buff1~0=~z$w_buff1~0_In2139187934, ~z~0=~z~0_In2139187934, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2139187934|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:28:50,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-295139685 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-295139685 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-295139685|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-295139685| ~z$w_buff0_used~0_In-295139685)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-295139685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-295139685} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-295139685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-295139685, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-295139685|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:28:50,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-609424227 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-609424227 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-609424227 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-609424227 256)))) (or (and (= ~z$w_buff1_used~0_In-609424227 |ULTIMATE.start_main_#t~ite22_Out-609424227|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-609424227|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-609424227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-609424227, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-609424227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-609424227} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-609424227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-609424227, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-609424227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-609424227, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-609424227|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:28:50,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In687474412 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In687474412 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out687474412| ~z$r_buff0_thd0~0_In687474412) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out687474412|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In687474412, ~z$w_buff0_used~0=~z$w_buff0_used~0_In687474412} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In687474412, ~z$w_buff0_used~0=~z$w_buff0_used~0_In687474412, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out687474412|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:28:50,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1937079101 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1937079101 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1937079101 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1937079101 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out-1937079101| 0)) (and (= |ULTIMATE.start_main_#t~ite24_Out-1937079101| ~z$r_buff1_thd0~0_In-1937079101) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1937079101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1937079101, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1937079101, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1937079101} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1937079101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1937079101, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1937079101, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1937079101|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1937079101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:28:50,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1410731747 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1410731747 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd0~0_In1410731747 256)) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1410731747 256))) (= (mod ~z$w_buff0_used~0_In1410731747 256) 0))) .cse1 (= |ULTIMATE.start_main_#t~ite36_Out1410731747| |ULTIMATE.start_main_#t~ite37_Out1410731747|) (= |ULTIMATE.start_main_#t~ite36_Out1410731747| ~z$w_buff0_used~0_In1410731747)) (and (= |ULTIMATE.start_main_#t~ite37_Out1410731747| ~z$w_buff0_used~0_In1410731747) (= |ULTIMATE.start_main_#t~ite36_In1410731747| |ULTIMATE.start_main_#t~ite36_Out1410731747|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1410731747, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1410731747, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1410731747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1410731747, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In1410731747|, ~weak$$choice2~0=~weak$$choice2~0_In1410731747} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1410731747, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1410731747, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1410731747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1410731747, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1410731747|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1410731747|, ~weak$$choice2~0=~weak$$choice2~0_In1410731747} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:28:50,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-930785268 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-930785268| |ULTIMATE.start_main_#t~ite40_Out-930785268|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-930785268 256)))) (or (and (= 0 (mod ~z$r_buff1_thd0~0_In-930785268 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-930785268 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-930785268 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-930785268| ~z$w_buff1_used~0_In-930785268)) (and (= ~z$w_buff1_used~0_In-930785268 |ULTIMATE.start_main_#t~ite40_Out-930785268|) (= |ULTIMATE.start_main_#t~ite39_In-930785268| |ULTIMATE.start_main_#t~ite39_Out-930785268|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-930785268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-930785268, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-930785268|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-930785268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-930785268, ~weak$$choice2~0=~weak$$choice2~0_In-930785268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-930785268, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-930785268|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-930785268|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-930785268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-930785268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-930785268, ~weak$$choice2~0=~weak$$choice2~0_In-930785268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:28:50,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:28:50,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:28:50,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:28:50,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:28:50 BasicIcfg [2019-12-18 17:28:50,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:28:50,606 INFO L168 Benchmark]: Toolchain (without parser) took 65036.24 ms. Allocated memory was 143.7 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 494.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:50,607 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 17:28:50,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.87 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 154.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:50,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.94 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:50,609 INFO L168 Benchmark]: Boogie Preprocessor took 40.45 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 149.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:50,609 INFO L168 Benchmark]: RCFGBuilder took 787.54 ms. Allocated memory is still 201.3 MB. Free memory was 149.3 MB in the beginning and 99.7 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:50,610 INFO L168 Benchmark]: TraceAbstraction took 63343.05 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 435.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:50,614 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.23 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.87 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 154.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.94 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.45 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 149.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.54 ms. Allocated memory is still 201.3 MB. Free memory was 149.3 MB in the beginning and 99.7 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63343.05 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 435.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 63.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3136 SDtfs, 4975 SDslu, 11170 SDs, 0 SdLazy, 5986 SolverSat, 368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65578occurred 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: 30.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 89300 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 877 NumberOfCodeBlocks, 877 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 796 ConstructedInterpolants, 0 QuantifiedInterpolants, 218995 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...