/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:08:00,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:08:00,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:08:00,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:08:00,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:08:00,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:08:00,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:08:00,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:08:00,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:08:00,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:08:00,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:08:00,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:08:00,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:08:00,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:08:00,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:08:00,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:08:00,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:08:00,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:08:00,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:08:00,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:08:00,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:08:00,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:08:00,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:08:00,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:08:00,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:08:00,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:08:00,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:08:00,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:08:00,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:08:00,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:08:00,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:08:00,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:08:00,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:08:00,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:08:00,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:08:00,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:08:00,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:08:00,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:08:00,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:08:00,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:08:00,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:08:00,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:08:00,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:08:00,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:08:00,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:08:00,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:08:00,322 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:08:00,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:08:00,323 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:08:00,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:08:00,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:08:00,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:08:00,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:08:00,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:08:00,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:08:00,324 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:08:00,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:08:00,324 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:08:00,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:08:00,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:08:00,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:08:00,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:08:00,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:08:00,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:08:00,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:08:00,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:08:00,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:08:00,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:08:00,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:08:00,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:08:00,327 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:08:00,327 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:08:00,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:08:00,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:08:00,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:08:00,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:08:00,647 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:08:00,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i [2019-12-18 12:08:00,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1688b58d3/0c7647dd95f749aaab0e00549710d744/FLAG950475771 [2019-12-18 12:08:01,298 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:08:01,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i [2019-12-18 12:08:01,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1688b58d3/0c7647dd95f749aaab0e00549710d744/FLAG950475771 [2019-12-18 12:08:01,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1688b58d3/0c7647dd95f749aaab0e00549710d744 [2019-12-18 12:08:01,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:08:01,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:08:01,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:08:01,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:08:01,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:08:01,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:08:01" (1/1) ... [2019-12-18 12:08:01,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667e2a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:01, skipping insertion in model container [2019-12-18 12:08:01,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:08:01" (1/1) ... [2019-12-18 12:08:01,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:08:01,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:08:02,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:08:02,274 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:08:02,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:08:02,419 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:08:02,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02 WrapperNode [2019-12-18 12:08:02,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:08:02,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:08:02,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:08:02,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:08:02,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (1/1) ... [2019-12-18 12:08:02,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (1/1) ... [2019-12-18 12:08:02,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:08:02,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:08:02,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:08:02,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:08:02,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (1/1) ... [2019-12-18 12:08:02,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (1/1) ... [2019-12-18 12:08:02,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (1/1) ... [2019-12-18 12:08:02,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (1/1) ... [2019-12-18 12:08:02,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (1/1) ... [2019-12-18 12:08:02,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (1/1) ... [2019-12-18 12:08:02,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (1/1) ... [2019-12-18 12:08:02,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:08:02,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:08:02,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:08:02,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:08:02,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (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 12:08:02,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:08:02,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:08:02,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:08:02,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:08:02,600 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:08:02,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:08:02,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:08:02,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:08:02,601 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:08:02,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:08:02,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:08:02,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:08:02,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:08:02,603 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 12:08:03,344 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:08:03,345 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:08:03,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:08:03 BoogieIcfgContainer [2019-12-18 12:08:03,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:08:03,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:08:03,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:08:03,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:08:03,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:08:01" (1/3) ... [2019-12-18 12:08:03,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267639c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:08:03, skipping insertion in model container [2019-12-18 12:08:03,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:08:02" (2/3) ... [2019-12-18 12:08:03,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267639c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:08:03, skipping insertion in model container [2019-12-18 12:08:03,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:08:03" (3/3) ... [2019-12-18 12:08:03,355 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_tso.oepc.i [2019-12-18 12:08:03,365 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:08:03,366 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:08:03,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:08:03,374 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:08:03,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,418 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,435 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,436 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,487 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,489 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,503 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,503 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:08:03,521 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:08:03,542 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:08:03,543 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:08:03,543 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:08:03,543 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:08:03,543 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:08:03,543 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:08:03,543 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:08:03,543 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:08:03,561 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 12:08:03,564 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:08:03,680 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:08:03,680 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:08:03,700 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:08:03,731 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:08:03,778 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:08:03,778 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:08:03,789 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:08:03,815 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:08:03,816 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:08:09,080 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:08:09,224 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:08:09,577 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-18 12:08:09,579 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 12:08:09,583 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 12:08:29,415 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-18 12:08:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-18 12:08:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:08:29,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:29,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:08:29,425 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:29,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:29,430 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-18 12:08:29,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:29,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649716990] [2019-12-18 12:08:29,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:29,642 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 12:08:29,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649716990] [2019-12-18 12:08:29,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:29,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:08:29,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948444771] [2019-12-18 12:08:29,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:29,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:29,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:29,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:29,664 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-18 12:08:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:32,820 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-18 12:08:32,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:32,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:08:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:33,493 INFO L225 Difference]: With dead ends: 119613 [2019-12-18 12:08:33,493 INFO L226 Difference]: Without dead ends: 105755 [2019-12-18 12:08:33,495 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 12:08:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-18 12:08:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-18 12:08:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-18 12:08:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-18 12:08:43,151 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-18 12:08:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:43,152 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-18 12:08:43,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-18 12:08:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:08:43,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:43,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:43,157 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:43,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:43,157 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-18 12:08:43,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:43,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900535473] [2019-12-18 12:08:43,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:43,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900535473] [2019-12-18 12:08:43,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:43,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:43,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336983279] [2019-12-18 12:08:43,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:08:43,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:43,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:08:43,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:43,277 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-18 12:08:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:48,293 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-18 12:08:48,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:08:48,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:08:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:48,988 INFO L225 Difference]: With dead ends: 168845 [2019-12-18 12:08:48,989 INFO L226 Difference]: Without dead ends: 168747 [2019-12-18 12:08:48,990 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 12:08:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-18 12:09:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-18 12:09:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-18 12:09:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-18 12:09:02,230 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-18 12:09:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:02,230 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-18 12:09:02,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:09:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-18 12:09:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:09:02,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:02,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:02,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:02,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-18 12:09:02,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:02,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41296930] [2019-12-18 12:09:02,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:02,303 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 12:09:02,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41296930] [2019-12-18 12:09:02,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:02,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:09:02,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280884626] [2019-12-18 12:09:02,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:09:02,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:02,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:09:02,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:02,305 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-18 12:09:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:02,492 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-18 12:09:02,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:09:02,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:09:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:02,564 INFO L225 Difference]: With dead ends: 33476 [2019-12-18 12:09:02,565 INFO L226 Difference]: Without dead ends: 33476 [2019-12-18 12:09:02,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-18 12:09:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-18 12:09:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-18 12:09:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-18 12:09:03,318 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-18 12:09:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:03,319 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-18 12:09:03,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:09:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-18 12:09:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:09:03,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:03,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:03,323 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-18 12:09:03,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:03,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294201241] [2019-12-18 12:09:03,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:03,407 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 12:09:03,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294201241] [2019-12-18 12:09:03,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:03,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:09:03,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967316428] [2019-12-18 12:09:03,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:09:03,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:03,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:09:03,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:09:03,410 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-18 12:09:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:03,770 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-18 12:09:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:09:03,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:09:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:03,838 INFO L225 Difference]: With dead ends: 41508 [2019-12-18 12:09:03,838 INFO L226 Difference]: Without dead ends: 41508 [2019-12-18 12:09:03,839 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 12:09:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-18 12:09:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-18 12:09:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-18 12:09:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-18 12:09:07,064 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-18 12:09:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:07,065 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-18 12:09:07,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:09:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-18 12:09:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:09:07,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:07,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:07,068 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:07,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-18 12:09:07,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:07,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57275292] [2019-12-18 12:09:07,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:07,141 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 12:09:07,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57275292] [2019-12-18 12:09:07,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:07,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:07,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768075430] [2019-12-18 12:09:07,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:09:07,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:07,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:09:07,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:07,143 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-18 12:09:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:07,379 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-18 12:09:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:09:07,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:09:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:07,474 INFO L225 Difference]: With dead ends: 54855 [2019-12-18 12:09:07,475 INFO L226 Difference]: Without dead ends: 54855 [2019-12-18 12:09:07,475 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 12:09:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-18 12:09:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-18 12:09:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-18 12:09:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-18 12:09:08,311 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-18 12:09:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:08,311 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-18 12:09:08,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:09:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-18 12:09:08,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:09:08,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:08,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:08,314 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:08,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:08,315 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-18 12:09:08,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:08,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458446861] [2019-12-18 12:09:08,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:08,390 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 12:09:08,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458446861] [2019-12-18 12:09:08,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:08,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:09:08,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368199868] [2019-12-18 12:09:08,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:09:08,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:08,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:09:08,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:09:08,391 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-18 12:09:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:08,791 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-18 12:09:08,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:09:08,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:09:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:09,335 INFO L225 Difference]: With dead ends: 49903 [2019-12-18 12:09:09,336 INFO L226 Difference]: Without dead ends: 49903 [2019-12-18 12:09:09,336 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 12:09:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-18 12:09:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-18 12:09:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-18 12:09:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-18 12:09:10,082 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-18 12:09:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:10,083 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-18 12:09:10,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:09:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-18 12:09:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:09:10,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:10,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:10,093 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:10,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:10,093 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-18 12:09:10,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:10,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287570788] [2019-12-18 12:09:10,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:10,193 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 12:09:10,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287570788] [2019-12-18 12:09:10,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:10,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:10,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188376187] [2019-12-18 12:09:10,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:09:10,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:10,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:09:10,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:09:10,195 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 5 states. [2019-12-18 12:09:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:10,871 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-18 12:09:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:09:10,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:09:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:10,973 INFO L225 Difference]: With dead ends: 59763 [2019-12-18 12:09:10,973 INFO L226 Difference]: Without dead ends: 59749 [2019-12-18 12:09:10,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 12:09:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-18 12:09:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-18 12:09:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-18 12:09:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-18 12:09:12,281 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-18 12:09:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:12,281 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-18 12:09:12,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:09:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-18 12:09:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:09:12,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:12,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:12,290 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-18 12:09:12,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:12,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692626958] [2019-12-18 12:09:12,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:12,364 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 12:09:12,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692626958] [2019-12-18 12:09:12,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:12,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:12,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893905421] [2019-12-18 12:09:12,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:09:12,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:12,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:09:12,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:09:12,366 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 5 states. [2019-12-18 12:09:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:13,020 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-18 12:09:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:09:13,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:09:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:13,139 INFO L225 Difference]: With dead ends: 62779 [2019-12-18 12:09:13,139 INFO L226 Difference]: Without dead ends: 62765 [2019-12-18 12:09:13,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 12:09:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-18 12:09:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-18 12:09:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-18 12:09:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-18 12:09:14,023 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-18 12:09:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:14,024 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-18 12:09:14,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:09:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-18 12:09:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:09:14,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:14,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:14,036 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:14,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:14,036 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-18 12:09:14,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:14,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557558701] [2019-12-18 12:09:14,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:14,091 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 12:09:14,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557558701] [2019-12-18 12:09:14,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:14,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:14,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702822835] [2019-12-18 12:09:14,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:09:14,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:14,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:09:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:09:14,094 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 4 states. [2019-12-18 12:09:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:14,208 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-18 12:09:14,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:09:14,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:09:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:14,248 INFO L225 Difference]: With dead ends: 17503 [2019-12-18 12:09:14,248 INFO L226 Difference]: Without dead ends: 17503 [2019-12-18 12:09:14,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:09:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-18 12:09:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-18 12:09:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-18 12:09:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-18 12:09:14,793 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-18 12:09:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:14,794 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-18 12:09:14,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:09:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-18 12:09:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:09:14,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:14,806 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] [2019-12-18 12:09:14,807 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:14,807 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-18 12:09:14,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:14,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514458525] [2019-12-18 12:09:14,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:14,850 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 12:09:14,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514458525] [2019-12-18 12:09:14,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:14,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:14,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294273899] [2019-12-18 12:09:14,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:09:14,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:14,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:09:14,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:14,852 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-18 12:09:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:14,967 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-18 12:09:14,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:09:14,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:09:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:14,996 INFO L225 Difference]: With dead ends: 22571 [2019-12-18 12:09:14,996 INFO L226 Difference]: Without dead ends: 22571 [2019-12-18 12:09:14,997 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 12:09:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-18 12:09:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-18 12:09:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-18 12:09:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-18 12:09:15,290 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-18 12:09:15,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:15,290 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-18 12:09:15,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:09:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-18 12:09:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:09:15,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:15,303 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] [2019-12-18 12:09:15,303 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:15,304 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-18 12:09:15,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:15,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888696546] [2019-12-18 12:09:15,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:15,359 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 12:09:15,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888696546] [2019-12-18 12:09:15,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:15,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:15,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941793028] [2019-12-18 12:09:15,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:09:15,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:15,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:09:15,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:09:15,361 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-18 12:09:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:15,774 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-18 12:09:15,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:09:15,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:09:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:15,813 INFO L225 Difference]: With dead ends: 21146 [2019-12-18 12:09:15,813 INFO L226 Difference]: Without dead ends: 21146 [2019-12-18 12:09:15,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:09:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-18 12:09:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-18 12:09:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-18 12:09:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-18 12:09:16,122 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-18 12:09:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:16,122 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-18 12:09:16,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:09:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-18 12:09:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:09:16,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:16,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:16,137 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-18 12:09:16,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:16,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169123087] [2019-12-18 12:09:16,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:16,196 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 12:09:16,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169123087] [2019-12-18 12:09:16,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:16,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:16,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121324439] [2019-12-18 12:09:16,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:09:16,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:16,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:09:16,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:09:16,198 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-18 12:09:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:16,551 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-18 12:09:16,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:09:16,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:09:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:16,582 INFO L225 Difference]: With dead ends: 23192 [2019-12-18 12:09:16,582 INFO L226 Difference]: Without dead ends: 23192 [2019-12-18 12:09:16,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:09:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-18 12:09:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-18 12:09:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-18 12:09:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-18 12:09:16,894 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-18 12:09:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:16,895 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-18 12:09:16,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:09:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-18 12:09:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:09:16,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:16,915 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] [2019-12-18 12:09:16,915 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-18 12:09:16,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:16,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439396219] [2019-12-18 12:09:16,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:17,029 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 12:09:17,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439396219] [2019-12-18 12:09:17,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:17,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:09:17,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894642466] [2019-12-18 12:09:17,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:09:17,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:17,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:09:17,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:09:17,031 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 6 states. [2019-12-18 12:09:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:17,763 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-18 12:09:17,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:09:17,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 12:09:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:17,810 INFO L225 Difference]: With dead ends: 26785 [2019-12-18 12:09:17,810 INFO L226 Difference]: Without dead ends: 26785 [2019-12-18 12:09:17,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:09:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-18 12:09:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-18 12:09:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-18 12:09:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-18 12:09:18,277 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-18 12:09:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:18,277 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-18 12:09:18,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:09:18,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-18 12:09:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:09:18,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:18,299 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] [2019-12-18 12:09:18,299 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:18,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:18,299 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-18 12:09:18,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:18,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028698519] [2019-12-18 12:09:18,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:18,388 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 12:09:18,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028698519] [2019-12-18 12:09:18,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:18,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:09:18,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387142833] [2019-12-18 12:09:18,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:09:18,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:09:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:09:18,390 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 6 states. [2019-12-18 12:09:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:19,198 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-18 12:09:19,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:09:19,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:09:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:19,256 INFO L225 Difference]: With dead ends: 25915 [2019-12-18 12:09:19,256 INFO L226 Difference]: Without dead ends: 25915 [2019-12-18 12:09:19,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:09:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-18 12:09:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-18 12:09:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-18 12:09:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-18 12:09:19,666 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-18 12:09:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:19,666 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-18 12:09:19,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:09:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-18 12:09:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:09:19,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:19,684 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 12:09:19,684 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-18 12:09:19,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:19,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743135132] [2019-12-18 12:09:19,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:19,736 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 12:09:19,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743135132] [2019-12-18 12:09:19,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:19,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:09:19,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616563491] [2019-12-18 12:09:19,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:09:19,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:19,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:09:19,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:19,739 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-18 12:09:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:19,810 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-18 12:09:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:09:19,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:09:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:19,842 INFO L225 Difference]: With dead ends: 17953 [2019-12-18 12:09:19,843 INFO L226 Difference]: Without dead ends: 17953 [2019-12-18 12:09:19,845 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 12:09:19,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-18 12:09:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-18 12:09:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-18 12:09:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-18 12:09:20,134 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-18 12:09:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:20,135 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-18 12:09:20,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:09:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-18 12:09:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:09:20,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:20,151 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 12:09:20,152 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:20,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:20,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-18 12:09:20,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:20,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589449866] [2019-12-18 12:09:20,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:20,239 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 12:09:20,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589449866] [2019-12-18 12:09:20,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:20,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:09:20,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979341815] [2019-12-18 12:09:20,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:09:20,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:20,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:09:20,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:20,243 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 3 states. [2019-12-18 12:09:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:20,332 INFO L93 Difference]: Finished difference Result 17953 states and 53342 transitions. [2019-12-18 12:09:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:09:20,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:09:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:20,365 INFO L225 Difference]: With dead ends: 17953 [2019-12-18 12:09:20,365 INFO L226 Difference]: Without dead ends: 17953 [2019-12-18 12:09:20,366 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 12:09:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-18 12:09:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 16037. [2019-12-18 12:09:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16037 states. [2019-12-18 12:09:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16037 states to 16037 states and 48092 transitions. [2019-12-18 12:09:20,641 INFO L78 Accepts]: Start accepts. Automaton has 16037 states and 48092 transitions. Word has length 40 [2019-12-18 12:09:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:20,641 INFO L462 AbstractCegarLoop]: Abstraction has 16037 states and 48092 transitions. [2019-12-18 12:09:20,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:09:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 16037 states and 48092 transitions. [2019-12-18 12:09:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:09:20,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:20,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:20,662 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:20,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:20,663 INFO L82 PathProgramCache]: Analyzing trace with hash -935567252, now seen corresponding path program 1 times [2019-12-18 12:09:20,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:20,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733923911] [2019-12-18 12:09:20,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:20,712 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 12:09:20,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733923911] [2019-12-18 12:09:20,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:20,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:09:20,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531602995] [2019-12-18 12:09:20,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:09:20,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:20,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:09:20,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:09:20,714 INFO L87 Difference]: Start difference. First operand 16037 states and 48092 transitions. Second operand 5 states. [2019-12-18 12:09:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:20,804 INFO L93 Difference]: Finished difference Result 14868 states and 45573 transitions. [2019-12-18 12:09:20,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:09:20,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 12:09:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:20,835 INFO L225 Difference]: With dead ends: 14868 [2019-12-18 12:09:20,835 INFO L226 Difference]: Without dead ends: 14868 [2019-12-18 12:09:20,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:09:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14868 states. [2019-12-18 12:09:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14868 to 14868. [2019-12-18 12:09:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14868 states. [2019-12-18 12:09:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14868 states to 14868 states and 45573 transitions. [2019-12-18 12:09:21,170 INFO L78 Accepts]: Start accepts. Automaton has 14868 states and 45573 transitions. Word has length 41 [2019-12-18 12:09:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:21,171 INFO L462 AbstractCegarLoop]: Abstraction has 14868 states and 45573 transitions. [2019-12-18 12:09:21,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:09:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 14868 states and 45573 transitions. [2019-12-18 12:09:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:09:21,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:21,194 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, 1, 1, 1, 1, 1] [2019-12-18 12:09:21,194 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:21,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash -344664589, now seen corresponding path program 1 times [2019-12-18 12:09:21,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:21,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272100752] [2019-12-18 12:09:21,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:21,303 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 12:09:21,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272100752] [2019-12-18 12:09:21,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:21,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:09:21,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643366827] [2019-12-18 12:09:21,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:09:21,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:09:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:09:21,310 INFO L87 Difference]: Start difference. First operand 14868 states and 45573 transitions. Second operand 7 states. [2019-12-18 12:09:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:21,903 INFO L93 Difference]: Finished difference Result 43451 states and 132340 transitions. [2019-12-18 12:09:21,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:09:21,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:09:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:21,969 INFO L225 Difference]: With dead ends: 43451 [2019-12-18 12:09:21,970 INFO L226 Difference]: Without dead ends: 33731 [2019-12-18 12:09:21,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:09:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33731 states. [2019-12-18 12:09:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33731 to 18516. [2019-12-18 12:09:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18516 states. [2019-12-18 12:09:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18516 states to 18516 states and 56848 transitions. [2019-12-18 12:09:22,481 INFO L78 Accepts]: Start accepts. Automaton has 18516 states and 56848 transitions. Word has length 65 [2019-12-18 12:09:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:22,482 INFO L462 AbstractCegarLoop]: Abstraction has 18516 states and 56848 transitions. [2019-12-18 12:09:22,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:09:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 18516 states and 56848 transitions. [2019-12-18 12:09:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:09:22,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:22,506 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, 1, 1, 1, 1, 1] [2019-12-18 12:09:22,507 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:22,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1662753005, now seen corresponding path program 2 times [2019-12-18 12:09:22,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:22,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864686356] [2019-12-18 12:09:22,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:22,588 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 12:09:22,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864686356] [2019-12-18 12:09:22,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:22,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:09:22,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550977456] [2019-12-18 12:09:22,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:09:22,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:09:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:09:22,591 INFO L87 Difference]: Start difference. First operand 18516 states and 56848 transitions. Second operand 7 states. [2019-12-18 12:09:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:23,114 INFO L93 Difference]: Finished difference Result 49218 states and 148223 transitions. [2019-12-18 12:09:23,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:09:23,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:09:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:23,164 INFO L225 Difference]: With dead ends: 49218 [2019-12-18 12:09:23,164 INFO L226 Difference]: Without dead ends: 35999 [2019-12-18 12:09:23,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:09:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35999 states. [2019-12-18 12:09:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35999 to 21947. [2019-12-18 12:09:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21947 states. [2019-12-18 12:09:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21947 states to 21947 states and 66970 transitions. [2019-12-18 12:09:23,614 INFO L78 Accepts]: Start accepts. Automaton has 21947 states and 66970 transitions. Word has length 65 [2019-12-18 12:09:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:23,614 INFO L462 AbstractCegarLoop]: Abstraction has 21947 states and 66970 transitions. [2019-12-18 12:09:23,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:09:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 21947 states and 66970 transitions. [2019-12-18 12:09:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:09:23,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:23,636 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, 1, 1, 1, 1, 1] [2019-12-18 12:09:23,636 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1251052155, now seen corresponding path program 3 times [2019-12-18 12:09:23,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:23,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177289830] [2019-12-18 12:09:23,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:23,730 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 12:09:23,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177289830] [2019-12-18 12:09:23,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:23,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:09:23,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520649436] [2019-12-18 12:09:23,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:09:23,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:23,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:09:23,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:09:23,732 INFO L87 Difference]: Start difference. First operand 21947 states and 66970 transitions. Second operand 7 states. [2019-12-18 12:09:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:24,172 INFO L93 Difference]: Finished difference Result 42421 states and 127518 transitions. [2019-12-18 12:09:24,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:09:24,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:09:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:24,230 INFO L225 Difference]: With dead ends: 42421 [2019-12-18 12:09:24,230 INFO L226 Difference]: Without dead ends: 39710 [2019-12-18 12:09:24,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:09:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39710 states. [2019-12-18 12:09:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39710 to 22043. [2019-12-18 12:09:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22043 states. [2019-12-18 12:09:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22043 states to 22043 states and 67314 transitions. [2019-12-18 12:09:24,720 INFO L78 Accepts]: Start accepts. Automaton has 22043 states and 67314 transitions. Word has length 65 [2019-12-18 12:09:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:24,720 INFO L462 AbstractCegarLoop]: Abstraction has 22043 states and 67314 transitions. [2019-12-18 12:09:24,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:09:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 22043 states and 67314 transitions. [2019-12-18 12:09:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:09:24,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:24,746 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, 1, 1, 1, 1, 1] [2019-12-18 12:09:24,746 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1414187811, now seen corresponding path program 4 times [2019-12-18 12:09:24,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:24,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990134951] [2019-12-18 12:09:24,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:24,804 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 12:09:24,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990134951] [2019-12-18 12:09:24,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:24,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:09:24,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866185680] [2019-12-18 12:09:24,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:09:24,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:24,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:09:24,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:24,807 INFO L87 Difference]: Start difference. First operand 22043 states and 67314 transitions. Second operand 3 states. [2019-12-18 12:09:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:24,980 INFO L93 Difference]: Finished difference Result 25110 states and 76797 transitions. [2019-12-18 12:09:24,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:09:24,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:09:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:25,160 INFO L225 Difference]: With dead ends: 25110 [2019-12-18 12:09:25,161 INFO L226 Difference]: Without dead ends: 25110 [2019-12-18 12:09:25,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25110 states. [2019-12-18 12:09:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25110 to 20735. [2019-12-18 12:09:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-18 12:09:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 64104 transitions. [2019-12-18 12:09:25,487 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 64104 transitions. Word has length 65 [2019-12-18 12:09:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:25,487 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 64104 transitions. [2019-12-18 12:09:25,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:09:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 64104 transitions. [2019-12-18 12:09:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:09:25,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:25,519 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, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:25,520 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:25,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:25,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1928104461, now seen corresponding path program 1 times [2019-12-18 12:09:25,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:25,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070218849] [2019-12-18 12:09:25,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:25,596 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 12:09:25,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070218849] [2019-12-18 12:09:25,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:25,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:09:25,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481209480] [2019-12-18 12:09:25,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:09:25,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:09:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:09:25,598 INFO L87 Difference]: Start difference. First operand 20735 states and 64104 transitions. Second operand 7 states. [2019-12-18 12:09:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:26,162 INFO L93 Difference]: Finished difference Result 43564 states and 133585 transitions. [2019-12-18 12:09:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:09:26,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:09:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:26,241 INFO L225 Difference]: With dead ends: 43564 [2019-12-18 12:09:26,241 INFO L226 Difference]: Without dead ends: 40319 [2019-12-18 12:09:26,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:09:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40319 states. [2019-12-18 12:09:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40319 to 20867. [2019-12-18 12:09:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20867 states. [2019-12-18 12:09:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20867 states to 20867 states and 64616 transitions. [2019-12-18 12:09:26,927 INFO L78 Accepts]: Start accepts. Automaton has 20867 states and 64616 transitions. Word has length 66 [2019-12-18 12:09:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:26,927 INFO L462 AbstractCegarLoop]: Abstraction has 20867 states and 64616 transitions. [2019-12-18 12:09:26,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:09:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 20867 states and 64616 transitions. [2019-12-18 12:09:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:09:26,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:26,949 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, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:26,949 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:26,949 INFO L82 PathProgramCache]: Analyzing trace with hash 104538735, now seen corresponding path program 2 times [2019-12-18 12:09:26,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:26,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179829411] [2019-12-18 12:09:26,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:27,009 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 12:09:27,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179829411] [2019-12-18 12:09:27,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:27,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:27,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776618177] [2019-12-18 12:09:27,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:09:27,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:27,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:09:27,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:09:27,011 INFO L87 Difference]: Start difference. First operand 20867 states and 64616 transitions. Second operand 4 states. [2019-12-18 12:09:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:27,189 INFO L93 Difference]: Finished difference Result 20682 states and 63880 transitions. [2019-12-18 12:09:27,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:09:27,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:09:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:27,240 INFO L225 Difference]: With dead ends: 20682 [2019-12-18 12:09:27,241 INFO L226 Difference]: Without dead ends: 20682 [2019-12-18 12:09:27,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 12:09:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20682 states. [2019-12-18 12:09:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20682 to 19455. [2019-12-18 12:09:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19455 states. [2019-12-18 12:09:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19455 states to 19455 states and 60082 transitions. [2019-12-18 12:09:27,788 INFO L78 Accepts]: Start accepts. Automaton has 19455 states and 60082 transitions. Word has length 66 [2019-12-18 12:09:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:27,789 INFO L462 AbstractCegarLoop]: Abstraction has 19455 states and 60082 transitions. [2019-12-18 12:09:27,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:09:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 19455 states and 60082 transitions. [2019-12-18 12:09:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:09:27,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:27,821 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, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:27,822 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1162997979, now seen corresponding path program 1 times [2019-12-18 12:09:27,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:27,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659318326] [2019-12-18 12:09:27,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:27,918 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 12:09:27,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659318326] [2019-12-18 12:09:27,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:27,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:09:27,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132877425] [2019-12-18 12:09:27,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:09:27,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:09:27,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:27,922 INFO L87 Difference]: Start difference. First operand 19455 states and 60082 transitions. Second operand 3 states. [2019-12-18 12:09:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:27,995 INFO L93 Difference]: Finished difference Result 16709 states and 50483 transitions. [2019-12-18 12:09:27,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:09:27,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:09:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:28,016 INFO L225 Difference]: With dead ends: 16709 [2019-12-18 12:09:28,016 INFO L226 Difference]: Without dead ends: 16709 [2019-12-18 12:09:28,018 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 12:09:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16709 states. [2019-12-18 12:09:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16709 to 15085. [2019-12-18 12:09:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15085 states. [2019-12-18 12:09:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15085 states to 15085 states and 45535 transitions. [2019-12-18 12:09:28,258 INFO L78 Accepts]: Start accepts. Automaton has 15085 states and 45535 transitions. Word has length 66 [2019-12-18 12:09:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:28,258 INFO L462 AbstractCegarLoop]: Abstraction has 15085 states and 45535 transitions. [2019-12-18 12:09:28,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:09:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 15085 states and 45535 transitions. [2019-12-18 12:09:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:28,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:28,274 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:28,274 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash -543525966, now seen corresponding path program 1 times [2019-12-18 12:09:28,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:28,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695487412] [2019-12-18 12:09:28,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:28,460 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 12:09:28,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695487412] [2019-12-18 12:09:28,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:28,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:09:28,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205889182] [2019-12-18 12:09:28,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:09:28,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:09:28,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:09:28,462 INFO L87 Difference]: Start difference. First operand 15085 states and 45535 transitions. Second operand 10 states. [2019-12-18 12:09:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:29,905 INFO L93 Difference]: Finished difference Result 22528 states and 67687 transitions. [2019-12-18 12:09:29,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:09:29,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:09:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:29,948 INFO L225 Difference]: With dead ends: 22528 [2019-12-18 12:09:29,948 INFO L226 Difference]: Without dead ends: 18655 [2019-12-18 12:09:29,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:09:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18655 states. [2019-12-18 12:09:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18655 to 15486. [2019-12-18 12:09:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-18 12:09:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46650 transitions. [2019-12-18 12:09:30,437 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46650 transitions. Word has length 67 [2019-12-18 12:09:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:30,437 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46650 transitions. [2019-12-18 12:09:30,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:09:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46650 transitions. [2019-12-18 12:09:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:30,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:30,463 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:30,463 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:30,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1737332378, now seen corresponding path program 2 times [2019-12-18 12:09:30,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:30,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374780464] [2019-12-18 12:09:30,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:30,671 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 12:09:30,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374780464] [2019-12-18 12:09:30,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:30,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:30,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928896087] [2019-12-18 12:09:30,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:09:30,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:30,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:09:30,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:09:30,674 INFO L87 Difference]: Start difference. First operand 15486 states and 46650 transitions. Second operand 11 states. [2019-12-18 12:09:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:32,034 INFO L93 Difference]: Finished difference Result 20850 states and 62350 transitions. [2019-12-18 12:09:32,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:09:32,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:09:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:32,065 INFO L225 Difference]: With dead ends: 20850 [2019-12-18 12:09:32,065 INFO L226 Difference]: Without dead ends: 18415 [2019-12-18 12:09:32,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:09:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18415 states. [2019-12-18 12:09:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18415 to 15406. [2019-12-18 12:09:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15406 states. [2019-12-18 12:09:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15406 states to 15406 states and 46410 transitions. [2019-12-18 12:09:32,317 INFO L78 Accepts]: Start accepts. Automaton has 15406 states and 46410 transitions. Word has length 67 [2019-12-18 12:09:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:32,317 INFO L462 AbstractCegarLoop]: Abstraction has 15406 states and 46410 transitions. [2019-12-18 12:09:32,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:09:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 15406 states and 46410 transitions. [2019-12-18 12:09:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:32,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:32,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, 1, 1, 1, 1, 1, 1, 1, 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 12:09:32,335 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash 202288426, now seen corresponding path program 3 times [2019-12-18 12:09:32,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:32,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822338098] [2019-12-18 12:09:32,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:32,476 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 12:09:32,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822338098] [2019-12-18 12:09:32,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:32,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:09:32,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568305526] [2019-12-18 12:09:32,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:09:32,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:09:32,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:09:32,478 INFO L87 Difference]: Start difference. First operand 15406 states and 46410 transitions. Second operand 10 states. [2019-12-18 12:09:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:33,802 INFO L93 Difference]: Finished difference Result 23323 states and 69368 transitions. [2019-12-18 12:09:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:09:33,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:09:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:33,829 INFO L225 Difference]: With dead ends: 23323 [2019-12-18 12:09:33,829 INFO L226 Difference]: Without dead ends: 19998 [2019-12-18 12:09:33,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:09:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2019-12-18 12:09:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 15790. [2019-12-18 12:09:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-18 12:09:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 47396 transitions. [2019-12-18 12:09:34,096 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 47396 transitions. Word has length 67 [2019-12-18 12:09:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:34,096 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 47396 transitions. [2019-12-18 12:09:34,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:09:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 47396 transitions. [2019-12-18 12:09:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:34,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:34,111 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:34,111 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 4 times [2019-12-18 12:09:34,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:34,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020502871] [2019-12-18 12:09:34,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:34,261 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 12:09:34,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020502871] [2019-12-18 12:09:34,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:34,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:34,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565899525] [2019-12-18 12:09:34,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:09:34,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:09:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:09:34,263 INFO L87 Difference]: Start difference. First operand 15790 states and 47396 transitions. Second operand 11 states. [2019-12-18 12:09:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:35,703 INFO L93 Difference]: Finished difference Result 22253 states and 66116 transitions. [2019-12-18 12:09:35,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:09:35,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:09:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:35,730 INFO L225 Difference]: With dead ends: 22253 [2019-12-18 12:09:35,730 INFO L226 Difference]: Without dead ends: 19642 [2019-12-18 12:09:35,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:09:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2019-12-18 12:09:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 15486. [2019-12-18 12:09:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-18 12:09:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46480 transitions. [2019-12-18 12:09:36,091 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46480 transitions. Word has length 67 [2019-12-18 12:09:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:36,091 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46480 transitions. [2019-12-18 12:09:36,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:09:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46480 transitions. [2019-12-18 12:09:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:36,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:36,107 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:36,107 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:36,108 INFO L82 PathProgramCache]: Analyzing trace with hash 668274002, now seen corresponding path program 5 times [2019-12-18 12:09:36,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:36,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543147491] [2019-12-18 12:09:36,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:36,583 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 12:09:36,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543147491] [2019-12-18 12:09:36,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:36,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:09:36,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229787117] [2019-12-18 12:09:36,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:09:36,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:36,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:09:36,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:09:36,586 INFO L87 Difference]: Start difference. First operand 15486 states and 46480 transitions. Second operand 15 states. [2019-12-18 12:09:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:40,834 INFO L93 Difference]: Finished difference Result 37861 states and 110596 transitions. [2019-12-18 12:09:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 12:09:40,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 12:09:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:40,876 INFO L225 Difference]: With dead ends: 37861 [2019-12-18 12:09:40,876 INFO L226 Difference]: Without dead ends: 32193 [2019-12-18 12:09:40,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=463, Invalid=2507, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 12:09:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32193 states. [2019-12-18 12:09:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32193 to 16501. [2019-12-18 12:09:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16501 states. [2019-12-18 12:09:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16501 states to 16501 states and 49129 transitions. [2019-12-18 12:09:41,231 INFO L78 Accepts]: Start accepts. Automaton has 16501 states and 49129 transitions. Word has length 67 [2019-12-18 12:09:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:41,231 INFO L462 AbstractCegarLoop]: Abstraction has 16501 states and 49129 transitions. [2019-12-18 12:09:41,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:09:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 16501 states and 49129 transitions. [2019-12-18 12:09:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:41,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:41,248 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:41,248 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:41,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:41,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1241758622, now seen corresponding path program 6 times [2019-12-18 12:09:41,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:41,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050591153] [2019-12-18 12:09:41,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:41,456 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 12:09:41,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050591153] [2019-12-18 12:09:41,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:41,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:41,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395053902] [2019-12-18 12:09:41,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:09:41,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:41,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:09:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:09:41,458 INFO L87 Difference]: Start difference. First operand 16501 states and 49129 transitions. Second operand 11 states. [2019-12-18 12:09:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:42,633 INFO L93 Difference]: Finished difference Result 33055 states and 97939 transitions. [2019-12-18 12:09:42,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:09:42,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:09:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:42,672 INFO L225 Difference]: With dead ends: 33055 [2019-12-18 12:09:42,672 INFO L226 Difference]: Without dead ends: 31140 [2019-12-18 12:09:42,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:09:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31140 states. [2019-12-18 12:09:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31140 to 18592. [2019-12-18 12:09:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18592 states. [2019-12-18 12:09:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18592 states to 18592 states and 55236 transitions. [2019-12-18 12:09:43,277 INFO L78 Accepts]: Start accepts. Automaton has 18592 states and 55236 transitions. Word has length 67 [2019-12-18 12:09:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:43,277 INFO L462 AbstractCegarLoop]: Abstraction has 18592 states and 55236 transitions. [2019-12-18 12:09:43,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:09:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 18592 states and 55236 transitions. [2019-12-18 12:09:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:43,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:43,295 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:43,295 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:43,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:43,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1213952882, now seen corresponding path program 7 times [2019-12-18 12:09:43,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:43,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603859995] [2019-12-18 12:09:43,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:43,436 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 12:09:43,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603859995] [2019-12-18 12:09:43,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:43,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:43,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940224749] [2019-12-18 12:09:43,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:09:43,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:09:43,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:09:43,438 INFO L87 Difference]: Start difference. First operand 18592 states and 55236 transitions. Second operand 11 states. [2019-12-18 12:09:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:44,489 INFO L93 Difference]: Finished difference Result 31672 states and 93201 transitions. [2019-12-18 12:09:44,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:09:44,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:09:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:44,526 INFO L225 Difference]: With dead ends: 31672 [2019-12-18 12:09:44,526 INFO L226 Difference]: Without dead ends: 26637 [2019-12-18 12:09:44,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:09:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26637 states. [2019-12-18 12:09:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26637 to 15226. [2019-12-18 12:09:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15226 states. [2019-12-18 12:09:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15226 states to 15226 states and 45449 transitions. [2019-12-18 12:09:44,837 INFO L78 Accepts]: Start accepts. Automaton has 15226 states and 45449 transitions. Word has length 67 [2019-12-18 12:09:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:44,837 INFO L462 AbstractCegarLoop]: Abstraction has 15226 states and 45449 transitions. [2019-12-18 12:09:44,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:09:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 15226 states and 45449 transitions. [2019-12-18 12:09:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:44,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:44,852 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:44,852 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:44,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:44,852 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 8 times [2019-12-18 12:09:44,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:44,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466213545] [2019-12-18 12:09:44,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:45,042 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 12:09:45,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466213545] [2019-12-18 12:09:45,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:45,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:09:45,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58850825] [2019-12-18 12:09:45,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:09:45,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:45,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:09:45,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:09:45,045 INFO L87 Difference]: Start difference. First operand 15226 states and 45449 transitions. Second operand 12 states. [2019-12-18 12:09:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:46,045 INFO L93 Difference]: Finished difference Result 26646 states and 78882 transitions. [2019-12-18 12:09:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:09:46,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:09:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:46,084 INFO L225 Difference]: With dead ends: 26646 [2019-12-18 12:09:46,084 INFO L226 Difference]: Without dead ends: 26431 [2019-12-18 12:09:46,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:09:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26431 states. [2019-12-18 12:09:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26431 to 15050. [2019-12-18 12:09:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15050 states. [2019-12-18 12:09:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15050 states to 15050 states and 44977 transitions. [2019-12-18 12:09:46,392 INFO L78 Accepts]: Start accepts. Automaton has 15050 states and 44977 transitions. Word has length 67 [2019-12-18 12:09:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:46,392 INFO L462 AbstractCegarLoop]: Abstraction has 15050 states and 44977 transitions. [2019-12-18 12:09:46,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:09:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15050 states and 44977 transitions. [2019-12-18 12:09:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:46,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:46,408 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:46,408 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 9 times [2019-12-18 12:09:46,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:46,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004874826] [2019-12-18 12:09:46,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:09:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:09:46,514 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:09:46,514 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:09:46,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t83~0.offset_23|) (= v_~z$r_buff0_thd2~0_185 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32|) |v_ULTIMATE.start_main_~#t83~0.offset_23| 0)) |v_#memory_int_21|) (= 0 v_~x~0_134) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t83~0.base_32|) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32| 1)) (= v_~z~0_178 0) (= v_~z$r_buff1_thd0~0_195 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t83~0.base_32| 4) |v_#length_23|) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= v_~z$w_buff1~0_222 0) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32|)) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t83~0.base=|v_ULTIMATE.start_main_~#t83~0.base_32|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~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_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_29|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_22|, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t83~0.offset=|v_ULTIMATE.start_main_~#t83~0.offset_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t83~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t85~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t84~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t85~0.base, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t83~0.offset, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:09:46,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In940310055 0)) (= ~z$r_buff0_thd3~0_In940310055 ~z$r_buff1_thd3~0_Out940310055) (= ~z$r_buff1_thd1~0_Out940310055 ~z$r_buff0_thd1~0_In940310055) (= ~x~0_In940310055 ~__unbuffered_p0_EAX~0_Out940310055) (= ~z$r_buff1_thd0~0_Out940310055 ~z$r_buff0_thd0~0_In940310055) (= ~z$r_buff0_thd1~0_Out940310055 1) (= ~z$r_buff1_thd2~0_Out940310055 ~z$r_buff0_thd2~0_In940310055)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In940310055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In940310055, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In940310055, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In940310055, ~x~0=~x~0_In940310055, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In940310055} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out940310055, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In940310055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out940310055, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out940310055, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out940310055, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out940310055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In940310055, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In940310055, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out940310055, ~x~0=~x~0_In940310055, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In940310055} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:09:46,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t84~0.offset_10| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t84~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t84~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t84~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11|) |v_ULTIMATE.start_main_~#t84~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t84~0.offset] because there is no mapped edge [2019-12-18 12:09:46,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1004424820 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-1004424820| |P1Thread1of1ForFork2_#t~ite9_Out-1004424820|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1004424820 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1004424820 |P1Thread1of1ForFork2_#t~ite9_Out-1004424820|)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1004424820| ~z$w_buff1~0_In-1004424820) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1004424820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1004424820, ~z$w_buff1~0=~z$w_buff1~0_In-1004424820, ~z~0=~z~0_In-1004424820} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1004424820|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1004424820, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1004424820|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1004424820, ~z$w_buff1~0=~z$w_buff1~0_In-1004424820, ~z~0=~z~0_In-1004424820} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:09:46,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-2030024167 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2030024167 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2030024167 |P1Thread1of1ForFork2_#t~ite11_Out-2030024167|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-2030024167|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2030024167, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2030024167} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2030024167, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-2030024167|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2030024167} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:09:46,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t85~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t85~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11|) |v_ULTIMATE.start_main_~#t85~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t85~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t85~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t85~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t85~0.offset] because there is no mapped edge [2019-12-18 12:09:46,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In641403597 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In641403597 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out641403597|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In641403597 |P0Thread1of1ForFork1_#t~ite5_Out641403597|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In641403597, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In641403597} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out641403597|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In641403597, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In641403597} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:09:46,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1446051042 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In1446051042 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1446051042 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1446051042 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out1446051042| ~z$w_buff1_used~0_In1446051042) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite6_Out1446051042| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1446051042, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1446051042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1446051042, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1446051042} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1446051042, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1446051042|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1446051042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1446051042, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1446051042} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:09:46,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In610889823 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In610889823 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In610889823 ~z$r_buff0_thd1~0_Out610889823) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out610889823 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In610889823, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In610889823} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In610889823, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out610889823|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out610889823} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:09:46,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1404225366 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1404225366 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1404225366 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1404225366 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1404225366 |P0Thread1of1ForFork1_#t~ite8_Out1404225366|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1404225366|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1404225366, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1404225366, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1404225366, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1404225366} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1404225366|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1404225366, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1404225366, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1404225366, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1404225366} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:09:46,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:09:46,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-895624794 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-895624794 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-895624794 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-895624794 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-895624794| 0)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-895624794 |P1Thread1of1ForFork2_#t~ite12_Out-895624794|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-895624794, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-895624794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-895624794, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-895624794} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-895624794, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-895624794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-895624794, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-895624794|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-895624794} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:09:46,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-2126040154 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2126040154 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-2126040154|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-2126040154 |P1Thread1of1ForFork2_#t~ite13_Out-2126040154|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126040154, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2126040154} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126040154, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2126040154|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2126040154} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:09:46,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In396671143 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In396671143 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In396671143 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In396671143 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out396671143| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In396671143 |P1Thread1of1ForFork2_#t~ite14_Out396671143|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In396671143, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In396671143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In396671143, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In396671143} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In396671143, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In396671143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In396671143, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out396671143|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In396671143} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:09:46,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:09:46,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-72013742 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite30_Out-72013742| ~z$w_buff1_used~0_In-72013742) (= |P2Thread1of1ForFork0_#t~ite29_In-72013742| |P2Thread1of1ForFork0_#t~ite29_Out-72013742|)) (and (= ~z$w_buff1_used~0_In-72013742 |P2Thread1of1ForFork0_#t~ite29_Out-72013742|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-72013742 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-72013742 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-72013742 256))) (= 0 (mod ~z$w_buff0_used~0_In-72013742 256)))) (= |P2Thread1of1ForFork0_#t~ite30_Out-72013742| |P2Thread1of1ForFork0_#t~ite29_Out-72013742|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-72013742, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-72013742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-72013742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-72013742, ~weak$$choice2~0=~weak$$choice2~0_In-72013742, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-72013742|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-72013742, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-72013742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-72013742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-72013742, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-72013742|, ~weak$$choice2~0=~weak$$choice2~0_In-72013742, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-72013742|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:09:46,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:09:46,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:09:46,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In729154349 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In729154349 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out729154349| ~z~0_In729154349) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out729154349| ~z$w_buff1~0_In729154349)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In729154349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In729154349, ~z$w_buff1~0=~z$w_buff1~0_In729154349, ~z~0=~z~0_In729154349} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out729154349|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In729154349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In729154349, ~z$w_buff1~0=~z$w_buff1~0_In729154349, ~z~0=~z~0_In729154349} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:09:46,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 12:09:46,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In2125312855 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2125312855 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2125312855 |P2Thread1of1ForFork0_#t~ite40_Out2125312855|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out2125312855| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2125312855, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2125312855} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2125312855, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2125312855|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2125312855} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:09:46,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1570935687 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1570935687 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1570935687 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1570935687 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out1570935687| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1570935687| ~z$w_buff1_used~0_In1570935687)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1570935687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1570935687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570935687, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1570935687} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1570935687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1570935687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570935687, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1570935687, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1570935687|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:09:46,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-155543332 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-155543332 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-155543332|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-155543332| ~z$r_buff0_thd3~0_In-155543332)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-155543332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-155543332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-155543332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-155543332, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-155543332|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:09:46,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1157121219 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1157121219 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1157121219 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1157121219 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1157121219| ~z$r_buff1_thd3~0_In-1157121219) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1157121219| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1157121219, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1157121219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1157121219, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1157121219} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1157121219|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1157121219, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1157121219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1157121219, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1157121219} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:09:46,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:09:46,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:09:46,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-1668383903| |ULTIMATE.start_main_#t~ite48_Out-1668383903|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1668383903 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1668383903 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1668383903| ~z~0_In-1668383903) .cse2) (and (= |ULTIMATE.start_main_#t~ite47_Out-1668383903| ~z$w_buff1~0_In-1668383903) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1668383903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1668383903, ~z$w_buff1~0=~z$w_buff1~0_In-1668383903, ~z~0=~z~0_In-1668383903} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1668383903, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1668383903|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1668383903, ~z$w_buff1~0=~z$w_buff1~0_In-1668383903, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1668383903|, ~z~0=~z~0_In-1668383903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:09:46,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1853604414 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1853604414 256)))) (or (and (= ~z$w_buff0_used~0_In-1853604414 |ULTIMATE.start_main_#t~ite49_Out-1853604414|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1853604414|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1853604414, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853604414} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1853604414, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853604414, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1853604414|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:09:46,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1616713242 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1616713242 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1616713242 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1616713242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1616713242| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out1616713242| ~z$w_buff1_used~0_In1616713242) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1616713242, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616713242, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1616713242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1616713242} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1616713242|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1616713242, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616713242, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1616713242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1616713242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:09:46,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In785402995 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In785402995 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out785402995| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In785402995 |ULTIMATE.start_main_#t~ite51_Out785402995|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In785402995, ~z$w_buff0_used~0=~z$w_buff0_used~0_In785402995} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In785402995, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out785402995|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In785402995} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:09:46,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1426121601 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1426121601 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1426121601 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1426121601 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1426121601|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1426121601 |ULTIMATE.start_main_#t~ite52_Out-1426121601|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1426121601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426121601, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1426121601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426121601} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1426121601|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1426121601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426121601, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1426121601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426121601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:09:46,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:09:46,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:09:46 BasicIcfg [2019-12-18 12:09:46,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:09:46,674 INFO L168 Benchmark]: Toolchain (without parser) took 105043.56 ms. Allocated memory was 136.3 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 99.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:09:46,675 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:09:46,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.65 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 98.7 MB in the beginning and 151.9 MB in the end (delta: -53.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:46,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.27 ms. Allocated memory is still 199.2 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:46,676 INFO L168 Benchmark]: Boogie Preprocessor took 45.77 ms. Allocated memory is still 199.2 MB. Free memory was 149.2 MB in the beginning and 147.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:46,677 INFO L168 Benchmark]: RCFGBuilder took 817.29 ms. Allocated memory is still 199.2 MB. Free memory was 147.1 MB in the beginning and 96.3 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:46,677 INFO L168 Benchmark]: TraceAbstraction took 103325.46 ms. Allocated memory was 199.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 96.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:09:46,681 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.51 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.65 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 98.7 MB in the beginning and 151.9 MB in the end (delta: -53.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.27 ms. Allocated memory is still 199.2 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.77 ms. Allocated memory is still 199.2 MB. Free memory was 149.2 MB in the beginning and 147.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.29 ms. Allocated memory is still 199.2 MB. Free memory was 147.1 MB in the beginning and 96.3 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103325.46 ms. Allocated memory was 199.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 96.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t83, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t84, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t85, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 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 [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 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) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 102.9s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8109 SDtfs, 9248 SDslu, 30521 SDs, 0 SdLazy, 14704 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 36 SyntacticMatches, 20 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 239451 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1474 NumberOfCodeBlocks, 1474 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1375 ConstructedInterpolants, 0 QuantifiedInterpolants, 292979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...