/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:17:20,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:17:20,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:17:20,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:17:20,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:17:20,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:17:20,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:17:20,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:17:20,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:17:20,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:17:20,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:17:20,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:17:20,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:17:20,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:17:20,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:17:20,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:17:20,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:17:20,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:17:20,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:17:20,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:17:20,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:17:20,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:17:20,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:17:20,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:17:20,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:17:20,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:17:20,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:17:20,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:17:20,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:17:20,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:17:20,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:17:20,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:17:20,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:17:20,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:17:20,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:17:20,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:17:20,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:17:20,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:17:20,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:17:20,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:17:20,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:17:20,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:17:20,415 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:17:20,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:17:20,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:17:20,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:17:20,418 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:17:20,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:17:20,419 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:17:20,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:17:20,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:17:20,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:17:20,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:17:20,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:17:20,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:17:20,421 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:17:20,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:17:20,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:17:20,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:17:20,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:17:20,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:17:20,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:17:20,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:17:20,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:17:20,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:17:20,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:17:20,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:17:20,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:17:20,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:17:20,424 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:17:20,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:17:20,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:17:20,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:17:20,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:17:20,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:17:20,742 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:17:20,742 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:17:20,743 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-18 22:17:20,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd35cd31/fb08a4bd552444b8830e23c33422aec5/FLAG1d1ff9de4 [2019-12-18 22:17:21,375 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:17:21,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-18 22:17:21,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd35cd31/fb08a4bd552444b8830e23c33422aec5/FLAG1d1ff9de4 [2019-12-18 22:17:21,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd35cd31/fb08a4bd552444b8830e23c33422aec5 [2019-12-18 22:17:21,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:17:21,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:17:21,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:17:21,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:17:21,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:17:21,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:17:21" (1/1) ... [2019-12-18 22:17:21,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:21, skipping insertion in model container [2019-12-18 22:17:21,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:17:21" (1/1) ... [2019-12-18 22:17:21,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:17:21,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:17:22,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:17:22,301 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:17:22,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:17:22,503 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:17:22,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22 WrapperNode [2019-12-18 22:17:22,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:17:22,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:17:22,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:17:22,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:17:22,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (1/1) ... [2019-12-18 22:17:22,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (1/1) ... [2019-12-18 22:17:22,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:17:22,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:17:22,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:17:22,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:17:22,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (1/1) ... [2019-12-18 22:17:22,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (1/1) ... [2019-12-18 22:17:22,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (1/1) ... [2019-12-18 22:17:22,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (1/1) ... [2019-12-18 22:17:22,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (1/1) ... [2019-12-18 22:17:22,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (1/1) ... [2019-12-18 22:17:22,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (1/1) ... [2019-12-18 22:17:22,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:17:22,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:17:22,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:17:22,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:17:22,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (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 22:17:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:17:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:17:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:17:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:17:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:17:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:17:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:17:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:17:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:17:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:17:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:17:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:17:22,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:17:22,708 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 22:17:23,455 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:17:23,455 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:17:23,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:17:23 BoogieIcfgContainer [2019-12-18 22:17:23,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:17:23,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:17:23,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:17:23,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:17:23,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:17:21" (1/3) ... [2019-12-18 22:17:23,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaa167f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:17:23, skipping insertion in model container [2019-12-18 22:17:23,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:22" (2/3) ... [2019-12-18 22:17:23,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaa167f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:17:23, skipping insertion in model container [2019-12-18 22:17:23,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:17:23" (3/3) ... [2019-12-18 22:17:23,466 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_power.opt.i [2019-12-18 22:17:23,477 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:17:23,477 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:17:23,485 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:17:23,486 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:17:23,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,534 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,557 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,557 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,557 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,584 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,584 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,592 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,593 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,593 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,600 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,601 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:23,626 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:17:23,648 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:17:23,648 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:17:23,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:17:23,648 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:17:23,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:17:23,648 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:17:23,649 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:17:23,649 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:17:23,666 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 22:17:23,668 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:17:23,749 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:17:23,749 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:17:23,764 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:17:23,790 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:17:23,834 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:17:23,834 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:17:23,844 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:17:23,867 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:17:23,868 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:17:27,701 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:17:27,826 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:17:27,848 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75395 [2019-12-18 22:17:27,848 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 22:17:27,852 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-18 22:17:41,631 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89162 states. [2019-12-18 22:17:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 89162 states. [2019-12-18 22:17:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:17:41,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:17:41,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:17:41,641 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:17:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:17:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash 795562218, now seen corresponding path program 1 times [2019-12-18 22:17:41,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:17:41,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108018414] [2019-12-18 22:17:41,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:17:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:17:41,863 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 22:17:41,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108018414] [2019-12-18 22:17:41,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:17:41,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:17:41,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522717793] [2019-12-18 22:17:41,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:17:41,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:17:41,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:17:41,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:17:41,887 INFO L87 Difference]: Start difference. First operand 89162 states. Second operand 3 states. [2019-12-18 22:17:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:17:43,281 INFO L93 Difference]: Finished difference Result 87552 states and 377777 transitions. [2019-12-18 22:17:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:17:43,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:17:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:17:46,233 INFO L225 Difference]: With dead ends: 87552 [2019-12-18 22:17:46,234 INFO L226 Difference]: Without dead ends: 82092 [2019-12-18 22:17:46,241 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 22:17:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82092 states. [2019-12-18 22:17:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82092 to 82092. [2019-12-18 22:17:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82092 states. [2019-12-18 22:17:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82092 states to 82092 states and 353697 transitions. [2019-12-18 22:17:51,895 INFO L78 Accepts]: Start accepts. Automaton has 82092 states and 353697 transitions. Word has length 5 [2019-12-18 22:17:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:17:51,896 INFO L462 AbstractCegarLoop]: Abstraction has 82092 states and 353697 transitions. [2019-12-18 22:17:51,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:17:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 82092 states and 353697 transitions. [2019-12-18 22:17:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:17:51,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:17:51,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:17:51,906 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:17:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:17:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1486977711, now seen corresponding path program 1 times [2019-12-18 22:17:51,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:17:51,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245797308] [2019-12-18 22:17:51,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:17:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:17:51,988 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 22:17:51,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245797308] [2019-12-18 22:17:51,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:17:51,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:17:51,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821052450] [2019-12-18 22:17:51,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:17:51,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:17:51,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:17:51,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:17:51,994 INFO L87 Difference]: Start difference. First operand 82092 states and 353697 transitions. Second operand 3 states. [2019-12-18 22:17:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:17:52,197 INFO L93 Difference]: Finished difference Result 21487 states and 74397 transitions. [2019-12-18 22:17:52,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:17:52,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:17:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:17:52,332 INFO L225 Difference]: With dead ends: 21487 [2019-12-18 22:17:52,332 INFO L226 Difference]: Without dead ends: 21487 [2019-12-18 22:17:52,333 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 22:17:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2019-12-18 22:17:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 21487. [2019-12-18 22:17:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21487 states. [2019-12-18 22:17:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21487 states to 21487 states and 74397 transitions. [2019-12-18 22:17:55,798 INFO L78 Accepts]: Start accepts. Automaton has 21487 states and 74397 transitions. Word has length 13 [2019-12-18 22:17:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:17:55,798 INFO L462 AbstractCegarLoop]: Abstraction has 21487 states and 74397 transitions. [2019-12-18 22:17:55,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:17:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 21487 states and 74397 transitions. [2019-12-18 22:17:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:17:55,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:17:55,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:17:55,801 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:17:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:17:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash -726251993, now seen corresponding path program 1 times [2019-12-18 22:17:55,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:17:55,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836591690] [2019-12-18 22:17:55,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:17:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:17:55,892 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 22:17:55,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836591690] [2019-12-18 22:17:55,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:17:55,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:17:55,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315762192] [2019-12-18 22:17:55,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:17:55,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:17:55,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:17:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:17:55,895 INFO L87 Difference]: Start difference. First operand 21487 states and 74397 transitions. Second operand 4 states. [2019-12-18 22:17:56,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:17:56,272 INFO L93 Difference]: Finished difference Result 31642 states and 105483 transitions. [2019-12-18 22:17:56,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:17:56,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:17:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:17:56,454 INFO L225 Difference]: With dead ends: 31642 [2019-12-18 22:17:56,454 INFO L226 Difference]: Without dead ends: 31628 [2019-12-18 22:17:56,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:17:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31628 states. [2019-12-18 22:17:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31628 to 28614. [2019-12-18 22:17:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28614 states. [2019-12-18 22:17:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28614 states to 28614 states and 96383 transitions. [2019-12-18 22:17:57,367 INFO L78 Accepts]: Start accepts. Automaton has 28614 states and 96383 transitions. Word has length 13 [2019-12-18 22:17:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:17:57,367 INFO L462 AbstractCegarLoop]: Abstraction has 28614 states and 96383 transitions. [2019-12-18 22:17:57,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:17:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 28614 states and 96383 transitions. [2019-12-18 22:17:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:17:57,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:17:57,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:17:57,370 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:17:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:17:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1448024626, now seen corresponding path program 1 times [2019-12-18 22:17:57,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:17:57,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461806558] [2019-12-18 22:17:57,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:17:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:17:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:17:57,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461806558] [2019-12-18 22:17:57,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:17:57,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:17:57,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734274112] [2019-12-18 22:17:57,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:17:57,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:17:57,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:17:57,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:17:57,470 INFO L87 Difference]: Start difference. First operand 28614 states and 96383 transitions. Second operand 5 states. [2019-12-18 22:17:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:17:58,246 INFO L93 Difference]: Finished difference Result 41448 states and 137006 transitions. [2019-12-18 22:17:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:17:58,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 22:17:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:17:58,333 INFO L225 Difference]: With dead ends: 41448 [2019-12-18 22:17:58,333 INFO L226 Difference]: Without dead ends: 41430 [2019-12-18 22:17:58,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:17:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41430 states. [2019-12-18 22:17:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41430 to 32619. [2019-12-18 22:17:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32619 states. [2019-12-18 22:17:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32619 states to 32619 states and 109205 transitions. [2019-12-18 22:17:59,238 INFO L78 Accepts]: Start accepts. Automaton has 32619 states and 109205 transitions. Word has length 14 [2019-12-18 22:17:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:17:59,239 INFO L462 AbstractCegarLoop]: Abstraction has 32619 states and 109205 transitions. [2019-12-18 22:17:59,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:17:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 32619 states and 109205 transitions. [2019-12-18 22:17:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:17:59,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:17:59,250 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 22:17:59,251 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:17:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:17:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash -84735485, now seen corresponding path program 1 times [2019-12-18 22:17:59,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:17:59,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455257020] [2019-12-18 22:17:59,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:17:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:17:59,437 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 22:17:59,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455257020] [2019-12-18 22:17:59,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:17:59,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:17:59,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966948620] [2019-12-18 22:17:59,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:17:59,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:17:59,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:17:59,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:17:59,438 INFO L87 Difference]: Start difference. First operand 32619 states and 109205 transitions. Second operand 6 states. [2019-12-18 22:18:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:00,513 INFO L93 Difference]: Finished difference Result 56365 states and 183236 transitions. [2019-12-18 22:18:00,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:18:00,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 22:18:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:00,640 INFO L225 Difference]: With dead ends: 56365 [2019-12-18 22:18:00,641 INFO L226 Difference]: Without dead ends: 56335 [2019-12-18 22:18:00,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56335 states. [2019-12-18 22:18:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56335 to 37720. [2019-12-18 22:18:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37720 states. [2019-12-18 22:18:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37720 states to 37720 states and 124779 transitions. [2019-12-18 22:18:01,565 INFO L78 Accepts]: Start accepts. Automaton has 37720 states and 124779 transitions. Word has length 22 [2019-12-18 22:18:01,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:01,565 INFO L462 AbstractCegarLoop]: Abstraction has 37720 states and 124779 transitions. [2019-12-18 22:18:01,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:18:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 37720 states and 124779 transitions. [2019-12-18 22:18:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:18:01,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:01,575 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 22:18:01,575 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1487058349, now seen corresponding path program 2 times [2019-12-18 22:18:01,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:01,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007112588] [2019-12-18 22:18:01,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:01,701 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 22:18:01,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007112588] [2019-12-18 22:18:01,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:01,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:18:01,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040519869] [2019-12-18 22:18:01,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:01,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:01,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:01,704 INFO L87 Difference]: Start difference. First operand 37720 states and 124779 transitions. Second operand 7 states. [2019-12-18 22:18:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:03,127 INFO L93 Difference]: Finished difference Result 56547 states and 183575 transitions. [2019-12-18 22:18:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:18:03,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 22:18:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:03,273 INFO L225 Difference]: With dead ends: 56547 [2019-12-18 22:18:03,273 INFO L226 Difference]: Without dead ends: 56505 [2019-12-18 22:18:03,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:18:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56505 states. [2019-12-18 22:18:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56505 to 32874. [2019-12-18 22:18:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32874 states. [2019-12-18 22:18:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32874 states to 32874 states and 109363 transitions. [2019-12-18 22:18:04,062 INFO L78 Accepts]: Start accepts. Automaton has 32874 states and 109363 transitions. Word has length 22 [2019-12-18 22:18:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:04,062 INFO L462 AbstractCegarLoop]: Abstraction has 32874 states and 109363 transitions. [2019-12-18 22:18:04,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 32874 states and 109363 transitions. [2019-12-18 22:18:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:18:04,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:04,075 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 22:18:04,075 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1211743988, now seen corresponding path program 1 times [2019-12-18 22:18:04,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:04,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126892534] [2019-12-18 22:18:04,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:04,126 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 22:18:04,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126892534] [2019-12-18 22:18:04,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:04,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:18:04,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633931635] [2019-12-18 22:18:04,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:18:04,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:18:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:18:04,128 INFO L87 Difference]: Start difference. First operand 32874 states and 109363 transitions. Second operand 4 states. [2019-12-18 22:18:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:04,205 INFO L93 Difference]: Finished difference Result 12715 states and 39293 transitions. [2019-12-18 22:18:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:18:04,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:18:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:04,230 INFO L225 Difference]: With dead ends: 12715 [2019-12-18 22:18:04,230 INFO L226 Difference]: Without dead ends: 12715 [2019-12-18 22:18:04,231 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 22:18:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12715 states. [2019-12-18 22:18:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12715 to 12619. [2019-12-18 22:18:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12619 states. [2019-12-18 22:18:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12619 states to 12619 states and 39013 transitions. [2019-12-18 22:18:04,448 INFO L78 Accepts]: Start accepts. Automaton has 12619 states and 39013 transitions. Word has length 25 [2019-12-18 22:18:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:04,450 INFO L462 AbstractCegarLoop]: Abstraction has 12619 states and 39013 transitions. [2019-12-18 22:18:04,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:18:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 12619 states and 39013 transitions. [2019-12-18 22:18:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:18:04,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:04,468 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 22:18:04,468 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash 261453908, now seen corresponding path program 1 times [2019-12-18 22:18:04,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:04,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567170216] [2019-12-18 22:18:04,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:04,532 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 22:18:04,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567170216] [2019-12-18 22:18:04,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:04,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:18:04,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661126276] [2019-12-18 22:18:04,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:04,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:04,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:04,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:04,535 INFO L87 Difference]: Start difference. First operand 12619 states and 39013 transitions. Second operand 3 states. [2019-12-18 22:18:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:04,723 INFO L93 Difference]: Finished difference Result 12618 states and 39011 transitions. [2019-12-18 22:18:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:04,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 22:18:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:04,743 INFO L225 Difference]: With dead ends: 12618 [2019-12-18 22:18:04,743 INFO L226 Difference]: Without dead ends: 12618 [2019-12-18 22:18:04,744 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 22:18:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12618 states. [2019-12-18 22:18:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12618 to 12618. [2019-12-18 22:18:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12618 states. [2019-12-18 22:18:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 39011 transitions. [2019-12-18 22:18:04,928 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 39011 transitions. Word has length 39 [2019-12-18 22:18:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:04,929 INFO L462 AbstractCegarLoop]: Abstraction has 12618 states and 39011 transitions. [2019-12-18 22:18:04,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 39011 transitions. [2019-12-18 22:18:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:18:04,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:04,948 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 22:18:04,948 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:04,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1879938010, now seen corresponding path program 1 times [2019-12-18 22:18:04,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:04,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810784028] [2019-12-18 22:18:04,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:05,020 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 22:18:05,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810784028] [2019-12-18 22:18:05,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:05,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:18:05,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510722235] [2019-12-18 22:18:05,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:18:05,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:05,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:18:05,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:18:05,023 INFO L87 Difference]: Start difference. First operand 12618 states and 39011 transitions. Second operand 5 states. [2019-12-18 22:18:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:05,089 INFO L93 Difference]: Finished difference Result 11359 states and 35772 transitions. [2019-12-18 22:18:05,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:18:05,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 22:18:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:05,107 INFO L225 Difference]: With dead ends: 11359 [2019-12-18 22:18:05,107 INFO L226 Difference]: Without dead ends: 11359 [2019-12-18 22:18:05,107 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 22:18:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11359 states. [2019-12-18 22:18:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11359 to 11019. [2019-12-18 22:18:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11019 states. [2019-12-18 22:18:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11019 states to 11019 states and 34816 transitions. [2019-12-18 22:18:05,274 INFO L78 Accepts]: Start accepts. Automaton has 11019 states and 34816 transitions. Word has length 40 [2019-12-18 22:18:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:05,274 INFO L462 AbstractCegarLoop]: Abstraction has 11019 states and 34816 transitions. [2019-12-18 22:18:05,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:18:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 11019 states and 34816 transitions. [2019-12-18 22:18:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:05,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:18:05,290 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:05,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1466334831, now seen corresponding path program 1 times [2019-12-18 22:18:05,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:05,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960020721] [2019-12-18 22:18:05,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:05,360 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 22:18:05,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960020721] [2019-12-18 22:18:05,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:05,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:18:05,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777415513] [2019-12-18 22:18:05,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:05,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:05,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:05,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:05,362 INFO L87 Difference]: Start difference. First operand 11019 states and 34816 transitions. Second operand 3 states. [2019-12-18 22:18:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:05,469 INFO L93 Difference]: Finished difference Result 14923 states and 47277 transitions. [2019-12-18 22:18:05,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:05,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:18:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:05,503 INFO L225 Difference]: With dead ends: 14923 [2019-12-18 22:18:05,504 INFO L226 Difference]: Without dead ends: 14923 [2019-12-18 22:18:05,504 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 22:18:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14923 states. [2019-12-18 22:18:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14923 to 12415. [2019-12-18 22:18:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12415 states. [2019-12-18 22:18:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12415 states to 12415 states and 39778 transitions. [2019-12-18 22:18:05,805 INFO L78 Accepts]: Start accepts. Automaton has 12415 states and 39778 transitions. Word has length 54 [2019-12-18 22:18:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:05,806 INFO L462 AbstractCegarLoop]: Abstraction has 12415 states and 39778 transitions. [2019-12-18 22:18:05,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 12415 states and 39778 transitions. [2019-12-18 22:18:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:05,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:05,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:05,826 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:05,827 INFO L82 PathProgramCache]: Analyzing trace with hash 81383116, now seen corresponding path program 1 times [2019-12-18 22:18:05,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:05,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144822456] [2019-12-18 22:18:05,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:05,938 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 22:18:05,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144822456] [2019-12-18 22:18:05,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:05,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:18:05,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218266545] [2019-12-18 22:18:05,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:18:05,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:18:05,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:18:05,940 INFO L87 Difference]: Start difference. First operand 12415 states and 39778 transitions. Second operand 4 states. [2019-12-18 22:18:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:06,051 INFO L93 Difference]: Finished difference Result 23746 states and 76295 transitions. [2019-12-18 22:18:06,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:18:06,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 22:18:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:06,076 INFO L225 Difference]: With dead ends: 23746 [2019-12-18 22:18:06,076 INFO L226 Difference]: Without dead ends: 11640 [2019-12-18 22:18:06,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 22:18:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11640 states. [2019-12-18 22:18:06,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11640 to 11640. [2019-12-18 22:18:06,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11640 states. [2019-12-18 22:18:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11640 states to 11640 states and 37407 transitions. [2019-12-18 22:18:06,420 INFO L78 Accepts]: Start accepts. Automaton has 11640 states and 37407 transitions. Word has length 54 [2019-12-18 22:18:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:06,420 INFO L462 AbstractCegarLoop]: Abstraction has 11640 states and 37407 transitions. [2019-12-18 22:18:06,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:18:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 11640 states and 37407 transitions. [2019-12-18 22:18:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:06,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:06,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:06,440 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:06,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:06,441 INFO L82 PathProgramCache]: Analyzing trace with hash -886395566, now seen corresponding path program 2 times [2019-12-18 22:18:06,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:06,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930912678] [2019-12-18 22:18:06,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:06,507 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 22:18:06,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930912678] [2019-12-18 22:18:06,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:06,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:18:06,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557495977] [2019-12-18 22:18:06,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:18:06,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:06,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:18:06,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:18:06,510 INFO L87 Difference]: Start difference. First operand 11640 states and 37407 transitions. Second operand 4 states. [2019-12-18 22:18:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:06,834 INFO L93 Difference]: Finished difference Result 29764 states and 97472 transitions. [2019-12-18 22:18:06,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:18:06,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 22:18:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:06,846 INFO L225 Difference]: With dead ends: 29764 [2019-12-18 22:18:06,847 INFO L226 Difference]: Without dead ends: 5215 [2019-12-18 22:18:06,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 22:18:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2019-12-18 22:18:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5215. [2019-12-18 22:18:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5215 states. [2019-12-18 22:18:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 17564 transitions. [2019-12-18 22:18:06,968 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 17564 transitions. Word has length 54 [2019-12-18 22:18:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:06,968 INFO L462 AbstractCegarLoop]: Abstraction has 5215 states and 17564 transitions. [2019-12-18 22:18:06,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:18:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 17564 transitions. [2019-12-18 22:18:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:06,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:06,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:06,975 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 139987658, now seen corresponding path program 3 times [2019-12-18 22:18:06,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:06,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244495469] [2019-12-18 22:18:06,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:07,054 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 22:18:07,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244495469] [2019-12-18 22:18:07,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:07,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:18:07,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36546398] [2019-12-18 22:18:07,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:07,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:07,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:07,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:07,057 INFO L87 Difference]: Start difference. First operand 5215 states and 17564 transitions. Second operand 7 states. [2019-12-18 22:18:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:07,325 INFO L93 Difference]: Finished difference Result 9815 states and 32405 transitions. [2019-12-18 22:18:07,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:18:07,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:18:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:07,341 INFO L225 Difference]: With dead ends: 9815 [2019-12-18 22:18:07,341 INFO L226 Difference]: Without dead ends: 7165 [2019-12-18 22:18:07,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:18:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2019-12-18 22:18:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 6422. [2019-12-18 22:18:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6422 states. [2019-12-18 22:18:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6422 states to 6422 states and 21551 transitions. [2019-12-18 22:18:07,523 INFO L78 Accepts]: Start accepts. Automaton has 6422 states and 21551 transitions. Word has length 54 [2019-12-18 22:18:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:07,523 INFO L462 AbstractCegarLoop]: Abstraction has 6422 states and 21551 transitions. [2019-12-18 22:18:07,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:07,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6422 states and 21551 transitions. [2019-12-18 22:18:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:07,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:07,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:07,537 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1645888394, now seen corresponding path program 4 times [2019-12-18 22:18:07,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:07,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008616669] [2019-12-18 22:18:07,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:07,625 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 22:18:07,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008616669] [2019-12-18 22:18:07,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:07,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:18:07,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366491569] [2019-12-18 22:18:07,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:07,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:07,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:07,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:07,628 INFO L87 Difference]: Start difference. First operand 6422 states and 21551 transitions. Second operand 7 states. [2019-12-18 22:18:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:07,878 INFO L93 Difference]: Finished difference Result 11902 states and 38980 transitions. [2019-12-18 22:18:07,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:18:07,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:18:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:07,893 INFO L225 Difference]: With dead ends: 11902 [2019-12-18 22:18:07,894 INFO L226 Difference]: Without dead ends: 8756 [2019-12-18 22:18:07,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:18:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8756 states. [2019-12-18 22:18:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8756 to 7826. [2019-12-18 22:18:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7826 states. [2019-12-18 22:18:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7826 states to 7826 states and 26019 transitions. [2019-12-18 22:18:08,028 INFO L78 Accepts]: Start accepts. Automaton has 7826 states and 26019 transitions. Word has length 54 [2019-12-18 22:18:08,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:08,028 INFO L462 AbstractCegarLoop]: Abstraction has 7826 states and 26019 transitions. [2019-12-18 22:18:08,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7826 states and 26019 transitions. [2019-12-18 22:18:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:08,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:08,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:08,038 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1656812138, now seen corresponding path program 5 times [2019-12-18 22:18:08,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:08,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877760307] [2019-12-18 22:18:08,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:08,115 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 22:18:08,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877760307] [2019-12-18 22:18:08,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:08,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:18:08,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311726817] [2019-12-18 22:18:08,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:08,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:08,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:08,117 INFO L87 Difference]: Start difference. First operand 7826 states and 26019 transitions. Second operand 7 states. [2019-12-18 22:18:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:08,447 INFO L93 Difference]: Finished difference Result 17215 states and 55787 transitions. [2019-12-18 22:18:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:18:08,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:18:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:08,473 INFO L225 Difference]: With dead ends: 17215 [2019-12-18 22:18:08,474 INFO L226 Difference]: Without dead ends: 14695 [2019-12-18 22:18:08,474 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 22:18:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14695 states. [2019-12-18 22:18:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14695 to 7986. [2019-12-18 22:18:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7986 states. [2019-12-18 22:18:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7986 states to 7986 states and 26559 transitions. [2019-12-18 22:18:08,646 INFO L78 Accepts]: Start accepts. Automaton has 7986 states and 26559 transitions. Word has length 54 [2019-12-18 22:18:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:08,646 INFO L462 AbstractCegarLoop]: Abstraction has 7986 states and 26559 transitions. [2019-12-18 22:18:08,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 7986 states and 26559 transitions. [2019-12-18 22:18:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:08,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:08,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:08,657 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:08,657 INFO L82 PathProgramCache]: Analyzing trace with hash -434377068, now seen corresponding path program 6 times [2019-12-18 22:18:08,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:08,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77230246] [2019-12-18 22:18:08,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:08,781 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 22:18:08,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77230246] [2019-12-18 22:18:08,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:08,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:18:08,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118948599] [2019-12-18 22:18:08,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:18:08,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:08,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:18:08,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:18:08,785 INFO L87 Difference]: Start difference. First operand 7986 states and 26559 transitions. Second operand 8 states. [2019-12-18 22:18:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:09,860 INFO L93 Difference]: Finished difference Result 20061 states and 62674 transitions. [2019-12-18 22:18:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:18:09,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 22:18:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:09,891 INFO L225 Difference]: With dead ends: 20061 [2019-12-18 22:18:09,891 INFO L226 Difference]: Without dead ends: 19977 [2019-12-18 22:18:09,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:18:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19977 states. [2019-12-18 22:18:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19977 to 13288. [2019-12-18 22:18:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13288 states. [2019-12-18 22:18:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13288 states to 13288 states and 41695 transitions. [2019-12-18 22:18:10,336 INFO L78 Accepts]: Start accepts. Automaton has 13288 states and 41695 transitions. Word has length 54 [2019-12-18 22:18:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:10,337 INFO L462 AbstractCegarLoop]: Abstraction has 13288 states and 41695 transitions. [2019-12-18 22:18:10,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:18:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 13288 states and 41695 transitions. [2019-12-18 22:18:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:10,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:10,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:10,360 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash -458785952, now seen corresponding path program 7 times [2019-12-18 22:18:10,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:10,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220087538] [2019-12-18 22:18:10,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:10,453 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 22:18:10,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220087538] [2019-12-18 22:18:10,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:10,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:18:10,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403068530] [2019-12-18 22:18:10,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:10,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:10,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:10,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:10,455 INFO L87 Difference]: Start difference. First operand 13288 states and 41695 transitions. Second operand 7 states. [2019-12-18 22:18:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:11,195 INFO L93 Difference]: Finished difference Result 21346 states and 65008 transitions. [2019-12-18 22:18:11,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:18:11,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:18:11,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:11,225 INFO L225 Difference]: With dead ends: 21346 [2019-12-18 22:18:11,226 INFO L226 Difference]: Without dead ends: 21236 [2019-12-18 22:18:11,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:18:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2019-12-18 22:18:11,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 17446. [2019-12-18 22:18:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17446 states. [2019-12-18 22:18:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 54229 transitions. [2019-12-18 22:18:11,525 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 54229 transitions. Word has length 54 [2019-12-18 22:18:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:11,525 INFO L462 AbstractCegarLoop]: Abstraction has 17446 states and 54229 transitions. [2019-12-18 22:18:11,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 54229 transitions. [2019-12-18 22:18:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:11,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:11,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:11,552 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:11,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2051129792, now seen corresponding path program 8 times [2019-12-18 22:18:11,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:11,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236274393] [2019-12-18 22:18:11,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:11,614 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 22:18:11,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236274393] [2019-12-18 22:18:11,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:11,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:18:11,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658431465] [2019-12-18 22:18:11,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:11,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:11,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:11,616 INFO L87 Difference]: Start difference. First operand 17446 states and 54229 transitions. Second operand 3 states. [2019-12-18 22:18:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:11,668 INFO L93 Difference]: Finished difference Result 11033 states and 34214 transitions. [2019-12-18 22:18:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:11,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:18:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:11,688 INFO L225 Difference]: With dead ends: 11033 [2019-12-18 22:18:11,688 INFO L226 Difference]: Without dead ends: 11033 [2019-12-18 22:18:11,689 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 22:18:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11033 states. [2019-12-18 22:18:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11033 to 10642. [2019-12-18 22:18:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10642 states. [2019-12-18 22:18:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10642 states to 10642 states and 32991 transitions. [2019-12-18 22:18:11,847 INFO L78 Accepts]: Start accepts. Automaton has 10642 states and 32991 transitions. Word has length 54 [2019-12-18 22:18:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:11,847 INFO L462 AbstractCegarLoop]: Abstraction has 10642 states and 32991 transitions. [2019-12-18 22:18:11,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 10642 states and 32991 transitions. [2019-12-18 22:18:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:11,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:11,859 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] [2019-12-18 22:18:11,859 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash -318791943, now seen corresponding path program 1 times [2019-12-18 22:18:11,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:11,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081277968] [2019-12-18 22:18:11,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:11,979 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 22:18:11,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081277968] [2019-12-18 22:18:11,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:11,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:18:11,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093577865] [2019-12-18 22:18:11,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:18:11,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:11,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:18:11,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:18:11,982 INFO L87 Difference]: Start difference. First operand 10642 states and 32991 transitions. Second operand 8 states. [2019-12-18 22:18:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:13,096 INFO L93 Difference]: Finished difference Result 14753 states and 44394 transitions. [2019-12-18 22:18:13,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:18:13,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-18 22:18:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:13,117 INFO L225 Difference]: With dead ends: 14753 [2019-12-18 22:18:13,117 INFO L226 Difference]: Without dead ends: 14645 [2019-12-18 22:18:13,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:18:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14645 states. [2019-12-18 22:18:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14645 to 11236. [2019-12-18 22:18:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11236 states. [2019-12-18 22:18:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11236 states to 11236 states and 34702 transitions. [2019-12-18 22:18:13,463 INFO L78 Accepts]: Start accepts. Automaton has 11236 states and 34702 transitions. Word has length 55 [2019-12-18 22:18:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:13,463 INFO L462 AbstractCegarLoop]: Abstraction has 11236 states and 34702 transitions. [2019-12-18 22:18:13,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:18:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 11236 states and 34702 transitions. [2019-12-18 22:18:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:13,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:13,476 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] [2019-12-18 22:18:13,476 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1048892077, now seen corresponding path program 2 times [2019-12-18 22:18:13,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:13,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101617703] [2019-12-18 22:18:13,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:13,654 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 22:18:13,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101617703] [2019-12-18 22:18:13,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:13,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:18:13,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911490182] [2019-12-18 22:18:13,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:18:13,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:13,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:18:13,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:18:13,656 INFO L87 Difference]: Start difference. First operand 11236 states and 34702 transitions. Second operand 10 states. [2019-12-18 22:18:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:14,837 INFO L93 Difference]: Finished difference Result 17280 states and 52746 transitions. [2019-12-18 22:18:14,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:18:14,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 22:18:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:14,856 INFO L225 Difference]: With dead ends: 17280 [2019-12-18 22:18:14,856 INFO L226 Difference]: Without dead ends: 12312 [2019-12-18 22:18:14,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:18:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12312 states. [2019-12-18 22:18:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12312 to 11478. [2019-12-18 22:18:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11478 states. [2019-12-18 22:18:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11478 states to 11478 states and 35266 transitions. [2019-12-18 22:18:15,029 INFO L78 Accepts]: Start accepts. Automaton has 11478 states and 35266 transitions. Word has length 55 [2019-12-18 22:18:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:15,029 INFO L462 AbstractCegarLoop]: Abstraction has 11478 states and 35266 transitions. [2019-12-18 22:18:15,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:18:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 11478 states and 35266 transitions. [2019-12-18 22:18:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:15,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:15,042 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] [2019-12-18 22:18:15,042 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:15,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1460850481, now seen corresponding path program 3 times [2019-12-18 22:18:15,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:15,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119372087] [2019-12-18 22:18:15,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:15,217 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 22:18:15,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119372087] [2019-12-18 22:18:15,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:15,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:18:15,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552884762] [2019-12-18 22:18:15,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:18:15,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:18:15,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:18:15,220 INFO L87 Difference]: Start difference. First operand 11478 states and 35266 transitions. Second operand 10 states. [2019-12-18 22:18:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:16,230 INFO L93 Difference]: Finished difference Result 17727 states and 53256 transitions. [2019-12-18 22:18:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:18:16,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 22:18:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:16,256 INFO L225 Difference]: With dead ends: 17727 [2019-12-18 22:18:16,256 INFO L226 Difference]: Without dead ends: 14029 [2019-12-18 22:18:16,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 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 22:18:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14029 states. [2019-12-18 22:18:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14029 to 11970. [2019-12-18 22:18:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11970 states. [2019-12-18 22:18:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11970 states to 11970 states and 36436 transitions. [2019-12-18 22:18:16,446 INFO L78 Accepts]: Start accepts. Automaton has 11970 states and 36436 transitions. Word has length 55 [2019-12-18 22:18:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:16,446 INFO L462 AbstractCegarLoop]: Abstraction has 11970 states and 36436 transitions. [2019-12-18 22:18:16,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:18:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 11970 states and 36436 transitions. [2019-12-18 22:18:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:16,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:16,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:16,458 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:16,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1440625269, now seen corresponding path program 4 times [2019-12-18 22:18:16,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:16,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244580412] [2019-12-18 22:18:16,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:16,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244580412] [2019-12-18 22:18:16,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:16,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:18:16,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269004487] [2019-12-18 22:18:16,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:18:16,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:16,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:18:16,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:16,637 INFO L87 Difference]: Start difference. First operand 11970 states and 36436 transitions. Second operand 11 states. [2019-12-18 22:18:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:17,587 INFO L93 Difference]: Finished difference Result 16792 states and 50242 transitions. [2019-12-18 22:18:17,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:18:17,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:18:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:17,607 INFO L225 Difference]: With dead ends: 16792 [2019-12-18 22:18:17,607 INFO L226 Difference]: Without dead ends: 13469 [2019-12-18 22:18:17,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:18:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13469 states. [2019-12-18 22:18:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13469 to 11643. [2019-12-18 22:18:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11643 states. [2019-12-18 22:18:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11643 states to 11643 states and 35471 transitions. [2019-12-18 22:18:17,936 INFO L78 Accepts]: Start accepts. Automaton has 11643 states and 35471 transitions. Word has length 55 [2019-12-18 22:18:17,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:17,936 INFO L462 AbstractCegarLoop]: Abstraction has 11643 states and 35471 transitions. [2019-12-18 22:18:17,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:18:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 11643 states and 35471 transitions. [2019-12-18 22:18:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:17,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:17,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] [2019-12-18 22:18:17,949 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:17,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash 331505035, now seen corresponding path program 5 times [2019-12-18 22:18:17,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:17,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543162830] [2019-12-18 22:18:17,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:18,143 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 22:18:18,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543162830] [2019-12-18 22:18:18,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:18,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:18:18,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073178833] [2019-12-18 22:18:18,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:18:18,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:18:18,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:18,148 INFO L87 Difference]: Start difference. First operand 11643 states and 35471 transitions. Second operand 11 states. [2019-12-18 22:18:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:18,908 INFO L93 Difference]: Finished difference Result 15847 states and 47833 transitions. [2019-12-18 22:18:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 22:18:18,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:18:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:18,930 INFO L225 Difference]: With dead ends: 15847 [2019-12-18 22:18:18,930 INFO L226 Difference]: Without dead ends: 15283 [2019-12-18 22:18:18,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:18:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15283 states. [2019-12-18 22:18:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15283 to 14235. [2019-12-18 22:18:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14235 states. [2019-12-18 22:18:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14235 states to 14235 states and 43054 transitions. [2019-12-18 22:18:19,147 INFO L78 Accepts]: Start accepts. Automaton has 14235 states and 43054 transitions. Word has length 55 [2019-12-18 22:18:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:19,147 INFO L462 AbstractCegarLoop]: Abstraction has 14235 states and 43054 transitions. [2019-12-18 22:18:19,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:18:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14235 states and 43054 transitions. [2019-12-18 22:18:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:19,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:19,167 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] [2019-12-18 22:18:19,167 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:19,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:19,167 INFO L82 PathProgramCache]: Analyzing trace with hash -979481461, now seen corresponding path program 6 times [2019-12-18 22:18:19,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:19,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035558661] [2019-12-18 22:18:19,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:19,333 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 22:18:19,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035558661] [2019-12-18 22:18:19,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:19,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:18:19,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787024213] [2019-12-18 22:18:19,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:18:19,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:18:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:19,337 INFO L87 Difference]: Start difference. First operand 14235 states and 43054 transitions. Second operand 11 states. [2019-12-18 22:18:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:19,991 INFO L93 Difference]: Finished difference Result 15769 states and 47015 transitions. [2019-12-18 22:18:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:18:19,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:18:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:20,008 INFO L225 Difference]: With dead ends: 15769 [2019-12-18 22:18:20,009 INFO L226 Difference]: Without dead ends: 12281 [2019-12-18 22:18:20,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:18:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12281 states. [2019-12-18 22:18:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12281 to 10989. [2019-12-18 22:18:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10989 states. [2019-12-18 22:18:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10989 states to 10989 states and 33472 transitions. [2019-12-18 22:18:20,175 INFO L78 Accepts]: Start accepts. Automaton has 10989 states and 33472 transitions. Word has length 55 [2019-12-18 22:18:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:20,175 INFO L462 AbstractCegarLoop]: Abstraction has 10989 states and 33472 transitions. [2019-12-18 22:18:20,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:18:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 10989 states and 33472 transitions. [2019-12-18 22:18:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:20,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:20,187 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] [2019-12-18 22:18:20,187 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 975434899, now seen corresponding path program 7 times [2019-12-18 22:18:20,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:20,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611409603] [2019-12-18 22:18:20,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:20,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611409603] [2019-12-18 22:18:20,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:20,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:18:20,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444767461] [2019-12-18 22:18:20,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:20,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:20,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:20,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:20,251 INFO L87 Difference]: Start difference. First operand 10989 states and 33472 transitions. Second operand 3 states. [2019-12-18 22:18:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:20,305 INFO L93 Difference]: Finished difference Result 10989 states and 33470 transitions. [2019-12-18 22:18:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:20,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:18:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:20,324 INFO L225 Difference]: With dead ends: 10989 [2019-12-18 22:18:20,325 INFO L226 Difference]: Without dead ends: 10989 [2019-12-18 22:18:20,325 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 22:18:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10989 states. [2019-12-18 22:18:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10989 to 10189. [2019-12-18 22:18:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10189 states. [2019-12-18 22:18:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10189 states to 10189 states and 31259 transitions. [2019-12-18 22:18:20,498 INFO L78 Accepts]: Start accepts. Automaton has 10189 states and 31259 transitions. Word has length 55 [2019-12-18 22:18:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:20,498 INFO L462 AbstractCegarLoop]: Abstraction has 10189 states and 31259 transitions. [2019-12-18 22:18:20,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10189 states and 31259 transitions. [2019-12-18 22:18:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:18:20,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:20,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:20,509 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:20,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1725340389, now seen corresponding path program 1 times [2019-12-18 22:18:20,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:20,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381937582] [2019-12-18 22:18:20,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:20,963 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 22:18:20,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381937582] [2019-12-18 22:18:20,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:20,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:18:20,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134193283] [2019-12-18 22:18:20,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:18:20,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:20,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:18:20,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:18:20,967 INFO L87 Difference]: Start difference. First operand 10189 states and 31259 transitions. Second operand 16 states. [2019-12-18 22:18:21,284 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-18 22:18:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:23,444 INFO L93 Difference]: Finished difference Result 13642 states and 40730 transitions. [2019-12-18 22:18:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 22:18:23,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 22:18:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:23,464 INFO L225 Difference]: With dead ends: 13642 [2019-12-18 22:18:23,465 INFO L226 Difference]: Without dead ends: 13344 [2019-12-18 22:18:23,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 22:18:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13344 states. [2019-12-18 22:18:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13344 to 10147. [2019-12-18 22:18:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10147 states. [2019-12-18 22:18:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10147 states to 10147 states and 31163 transitions. [2019-12-18 22:18:23,632 INFO L78 Accepts]: Start accepts. Automaton has 10147 states and 31163 transitions. Word has length 56 [2019-12-18 22:18:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:23,632 INFO L462 AbstractCegarLoop]: Abstraction has 10147 states and 31163 transitions. [2019-12-18 22:18:23,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:18:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 10147 states and 31163 transitions. [2019-12-18 22:18:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:18:23,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:23,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:23,642 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1755725825, now seen corresponding path program 2 times [2019-12-18 22:18:23,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:23,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700532777] [2019-12-18 22:18:23,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:23,798 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 22:18:23,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700532777] [2019-12-18 22:18:23,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:23,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:18:23,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163269538] [2019-12-18 22:18:23,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:18:23,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:18:23,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:23,800 INFO L87 Difference]: Start difference. First operand 10147 states and 31163 transitions. Second operand 11 states. [2019-12-18 22:18:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:24,789 INFO L93 Difference]: Finished difference Result 11255 states and 34014 transitions. [2019-12-18 22:18:24,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:18:24,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 22:18:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:24,806 INFO L225 Difference]: With dead ends: 11255 [2019-12-18 22:18:24,806 INFO L226 Difference]: Without dead ends: 11017 [2019-12-18 22:18:24,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:18:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-12-18 22:18:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 10039. [2019-12-18 22:18:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10039 states. [2019-12-18 22:18:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10039 states to 10039 states and 30905 transitions. [2019-12-18 22:18:24,961 INFO L78 Accepts]: Start accepts. Automaton has 10039 states and 30905 transitions. Word has length 56 [2019-12-18 22:18:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:24,962 INFO L462 AbstractCegarLoop]: Abstraction has 10039 states and 30905 transitions. [2019-12-18 22:18:24,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:18:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 10039 states and 30905 transitions. [2019-12-18 22:18:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:18:24,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:24,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:24,973 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1747486899, now seen corresponding path program 3 times [2019-12-18 22:18:24,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:24,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096562081] [2019-12-18 22:18:24,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:18:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:18:25,072 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:18:25,072 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:18:25,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_43 0) (= 0 v_~x$w_buff0_used~0_108) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1828~0.base_27| 4)) (= v_~main$tmp_guard1~0_18 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_27|)) (= 0 v_~x$r_buff0_thd3~0_21) (= 0 v_~x$w_buff1~0_25) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_27| 1)) (= 0 |v_ULTIMATE.start_main_~#t1828~0.offset_19|) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_#NULL.offset_3| 0) (= v_~x~0_26 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~y~0_19 0) (= v_~x$r_buff1_thd0~0_26 0) (= 0 v_~weak$$choice2~0_32) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$w_buff0~0_25) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~x$flush_delayed~0_14 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_27|) |v_ULTIMATE.start_main_~#t1828~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~x$r_buff0_thd1~0_74) (= v_~x$r_buff1_thd3~0_18 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= v_~x$mem_tmp~0_11 0) (= 0 v_~__unbuffered_cnt~0_22) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1828~0.base_27|) (= v_~x$r_buff1_thd2~0_20 0) (= v_~__unbuffered_p0_EBX~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_14|, ULTIMATE.start_main_~#t1828~0.offset=|v_ULTIMATE.start_main_~#t1828~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_~#t1828~0.base=|v_ULTIMATE.start_main_~#t1828~0.base_27|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_74, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_19, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1830~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1830~0.offset, ULTIMATE.start_main_~#t1828~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t1829~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1829~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1828~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:18:25,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L816-1-->L818: Formula: (and (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10|) |v_ULTIMATE.start_main_~#t1829~0.offset_10| 1))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1829~0.base_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1829~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1829~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1829~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1829~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1829~0.base] because there is no mapped edge [2019-12-18 22:18:25,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L818-1-->L820: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1830~0.base_10| 4) |v_#length_13|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1830~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10|) |v_ULTIMATE.start_main_~#t1830~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1830~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1830~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1830~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 22:18:25,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:18:25,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-936650343 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-936650343 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-936650343 |P2Thread1of1ForFork1_#t~ite32_Out-936650343|) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-936650343 |P2Thread1of1ForFork1_#t~ite32_Out-936650343|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-936650343, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-936650343, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-936650343, ~x~0=~x~0_In-936650343} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-936650343|, ~x$w_buff1~0=~x$w_buff1~0_In-936650343, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-936650343, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-936650343, ~x~0=~x~0_In-936650343} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:18:25,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-364455877 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-364455877 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-364455877| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-364455877| ~x$w_buff0_used~0_In-364455877)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-364455877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-364455877} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-364455877, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-364455877|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-364455877} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:18:25,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:18:25,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1908166406 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1908166406 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1908166406 |P2Thread1of1ForFork1_#t~ite34_Out-1908166406|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1908166406|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1908166406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1908166406} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1908166406|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1908166406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1908166406} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:18:25,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-2020555265 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2020555265 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2020555265 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-2020555265 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2020555265 |P1Thread1of1ForFork0_#t~ite29_Out-2020555265|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-2020555265|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2020555265, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2020555265, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2020555265, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2020555265} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2020555265, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2020555265, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2020555265, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2020555265|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2020555265} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:18:25,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In862057051 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In862057051 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out862057051 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In862057051 ~x$r_buff0_thd2~0_Out862057051)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In862057051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In862057051} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out862057051|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out862057051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In862057051} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:18:25,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2110507781 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2110507781 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In2110507781 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In2110507781 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out2110507781| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out2110507781| ~x$r_buff1_thd2~0_In2110507781) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2110507781, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2110507781, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2110507781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2110507781} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2110507781|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2110507781, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2110507781, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2110507781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2110507781} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:18:25,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_16 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:18:25,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-288895568 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-288895568 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-288895568 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-288895568 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-288895568| ~x$w_buff1_used~0_In-288895568)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-288895568| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-288895568, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-288895568, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-288895568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288895568} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-288895568|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-288895568, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-288895568, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-288895568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288895568} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:18:25,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In407359450 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In407359450 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out407359450| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out407359450| ~x$r_buff0_thd3~0_In407359450)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In407359450, ~x$w_buff0_used~0=~x$w_buff0_used~0_In407359450} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out407359450|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In407359450, ~x$w_buff0_used~0=~x$w_buff0_used~0_In407359450} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:18:25,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In319157681 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_In319157681| |P0Thread1of1ForFork2_#t~ite11_Out319157681|) (= |P0Thread1of1ForFork2_#t~ite12_Out319157681| ~x$w_buff1~0_In319157681) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite12_Out319157681| |P0Thread1of1ForFork2_#t~ite11_Out319157681|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In319157681 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In319157681 256))) (= 0 (mod ~x$w_buff0_used~0_In319157681 256)) (and (= (mod ~x$r_buff1_thd1~0_In319157681 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite11_Out319157681| ~x$w_buff1~0_In319157681)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In319157681, ~x$w_buff1~0=~x$w_buff1~0_In319157681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In319157681, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In319157681, ~weak$$choice2~0=~weak$$choice2~0_In319157681, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In319157681|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In319157681} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In319157681, ~x$w_buff1~0=~x$w_buff1~0_In319157681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In319157681, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In319157681, ~weak$$choice2~0=~weak$$choice2~0_In319157681, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out319157681|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out319157681|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In319157681} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 22:18:25,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-483137034 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out-483137034| ~x$w_buff0_used~0_In-483137034) (= |P0Thread1of1ForFork2_#t~ite14_In-483137034| |P0Thread1of1ForFork2_#t~ite14_Out-483137034|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-483137034 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-483137034 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-483137034 256))) (= (mod ~x$w_buff0_used~0_In-483137034 256) 0))) (= |P0Thread1of1ForFork2_#t~ite14_Out-483137034| |P0Thread1of1ForFork2_#t~ite15_Out-483137034|) .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out-483137034| ~x$w_buff0_used~0_In-483137034)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-483137034, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-483137034, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-483137034, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-483137034|, ~weak$$choice2~0=~weak$$choice2~0_In-483137034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-483137034} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-483137034, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-483137034, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-483137034|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-483137034, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-483137034|, ~weak$$choice2~0=~weak$$choice2~0_In-483137034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-483137034} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 22:18:25,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_54 v_~x$r_buff0_thd1~0_53) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:18:25,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In816223371 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In816223371| |P0Thread1of1ForFork2_#t~ite23_Out816223371|) (= ~x$r_buff1_thd1~0_In816223371 |P0Thread1of1ForFork2_#t~ite24_Out816223371|)) (and .cse0 (= ~x$r_buff1_thd1~0_In816223371 |P0Thread1of1ForFork2_#t~ite23_Out816223371|) (= |P0Thread1of1ForFork2_#t~ite24_Out816223371| |P0Thread1of1ForFork2_#t~ite23_Out816223371|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In816223371 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In816223371 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In816223371 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In816223371 256)) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In816223371, ~x$w_buff1_used~0=~x$w_buff1_used~0_In816223371, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In816223371, ~weak$$choice2~0=~weak$$choice2~0_In816223371, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In816223371|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In816223371} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In816223371, ~x$w_buff1_used~0=~x$w_buff1_used~0_In816223371, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In816223371, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out816223371|, ~weak$$choice2~0=~weak$$choice2~0_In816223371, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out816223371|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In816223371} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 22:18:25,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:18:25,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In1566520241 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1566520241 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1566520241 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1566520241 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1566520241| ~x$r_buff1_thd3~0_In1566520241) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1566520241| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1566520241, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1566520241, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1566520241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1566520241} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1566520241|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1566520241, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1566520241, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1566520241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1566520241} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:18:25,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:18:25,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:18:25,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite41_Out1605774295| |ULTIMATE.start_main_#t~ite42_Out1605774295|)) (.cse0 (= (mod ~x$w_buff1_used~0_In1605774295 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1605774295 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite41_Out1605774295| ~x$w_buff1~0_In1605774295)) (and .cse1 (= |ULTIMATE.start_main_#t~ite41_Out1605774295| ~x~0_In1605774295) (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1605774295, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1605774295, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1605774295, ~x~0=~x~0_In1605774295} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1605774295|, ~x$w_buff1~0=~x$w_buff1~0_In1605774295, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1605774295, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1605774295, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1605774295|, ~x~0=~x~0_In1605774295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 22:18:25,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-845007752 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-845007752 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-845007752| ~x$w_buff0_used~0_In-845007752)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-845007752|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-845007752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-845007752} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-845007752, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-845007752|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-845007752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:18:25,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In331303270 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In331303270 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In331303270 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In331303270 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out331303270| ~x$w_buff1_used~0_In331303270) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out331303270| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In331303270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In331303270, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In331303270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In331303270} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In331303270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In331303270, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In331303270, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out331303270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In331303270} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:18:25,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2137251113 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2137251113 256)))) (or (and (= ~x$r_buff0_thd0~0_In-2137251113 |ULTIMATE.start_main_#t~ite45_Out-2137251113|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-2137251113|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137251113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137251113} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137251113, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2137251113|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137251113} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:18:25,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1974593237 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1974593237 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1974593237 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1974593237 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1974593237| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out1974593237| ~x$r_buff1_thd0~0_In1974593237)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1974593237, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1974593237, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1974593237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1974593237} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1974593237, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1974593237|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1974593237, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1974593237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1974593237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:18:25,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~__unbuffered_p0_EAX~0_9 2) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:18:25,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:18:25 BasicIcfg [2019-12-18 22:18:25,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:18:25,180 INFO L168 Benchmark]: Toolchain (without parser) took 63490.30 ms. Allocated memory was 141.0 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 100.6 MB in the beginning and 811.3 MB in the end (delta: -710.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 22:18:25,180 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 120.7 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:18:25,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.64 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 158.2 MB in the end (delta: -57.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:18:25,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.65 ms. Allocated memory is still 204.5 MB. Free memory was 158.2 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:18:25,189 INFO L168 Benchmark]: Boogie Preprocessor took 49.25 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 153.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:18:25,190 INFO L168 Benchmark]: RCFGBuilder took 835.33 ms. Allocated memory is still 204.5 MB. Free memory was 153.6 MB in the beginning and 106.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:18:25,190 INFO L168 Benchmark]: TraceAbstraction took 61720.15 ms. Allocated memory was 204.5 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 106.7 MB in the beginning and 811.3 MB in the end (delta: -704.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 22:18:25,199 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.20 ms. Allocated memory is still 141.0 MB. Free memory was 120.7 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.64 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 158.2 MB in the end (delta: -57.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.65 ms. Allocated memory is still 204.5 MB. Free memory was 158.2 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.25 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 153.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.33 ms. Allocated memory is still 204.5 MB. Free memory was 153.6 MB in the beginning and 106.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61720.15 ms. Allocated memory was 204.5 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 106.7 MB in the beginning and 811.3 MB in the end (delta: -704.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 93 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6473 VarBasedMoverChecksPositive, 209 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75395 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.4s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4567 SDtfs, 6414 SDslu, 15794 SDs, 0 SdLazy, 10980 SolverSat, 330 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 36 SyntacticMatches, 20 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 91710 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1232 NumberOfCodeBlocks, 1232 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1149 ConstructedInterpolants, 0 QuantifiedInterpolants, 217695 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...