/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:43:45,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:43:45,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:43:45,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:43:45,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:43:45,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:43:45,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:43:45,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:43:45,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:43:45,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:43:45,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:43:45,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:43:45,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:43:45,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:43:45,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:43:45,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:43:45,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:43:45,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:43:45,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:43:45,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:43:45,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:43:45,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:43:45,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:43:45,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:43:45,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:43:45,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:43:45,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:43:45,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:43:45,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:43:45,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:43:45,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:43:45,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:43:45,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:43:45,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:43:45,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:43:45,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:43:45,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:43:45,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:43:45,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:43:45,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:43:45,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:43:45,664 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:43:45,695 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:43:45,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:43:45,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:43:45,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:43:45,702 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:43:45,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:43:45,702 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:43:45,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:43:45,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:43:45,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:43:45,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:43:45,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:43:45,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:43:45,706 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:43:45,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:43:45,706 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:43:45,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:43:45,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:43:45,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:43:45,707 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:43:45,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:43:45,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:43:45,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:43:45,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:43:45,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:43:45,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:43:45,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:43:45,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:43:45,709 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:43:45,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:43:46,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:43:46,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:43:46,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:43:46,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:43:46,030 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:43:46,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i [2019-12-26 23:43:46,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47acc0896/1a305d7d90d34041a1ed88d332d2d0d7/FLAG801229394 [2019-12-26 23:43:46,672 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:43:46,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i [2019-12-26 23:43:46,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47acc0896/1a305d7d90d34041a1ed88d332d2d0d7/FLAG801229394 [2019-12-26 23:43:46,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47acc0896/1a305d7d90d34041a1ed88d332d2d0d7 [2019-12-26 23:43:46,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:43:46,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:43:46,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:46,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:43:46,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:43:46,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:46" (1/1) ... [2019-12-26 23:43:46,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0f289a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:46, skipping insertion in model container [2019-12-26 23:43:46,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:46" (1/1) ... [2019-12-26 23:43:46,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:43:47,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:43:47,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:47,651 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:43:47,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:47,837 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:43:47,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47 WrapperNode [2019-12-26 23:43:47,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:47,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:47,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:43:47,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:43:47,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (1/1) ... [2019-12-26 23:43:47,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (1/1) ... [2019-12-26 23:43:47,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:47,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:43:47,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:43:47,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:43:47,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (1/1) ... [2019-12-26 23:43:47,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (1/1) ... [2019-12-26 23:43:47,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (1/1) ... [2019-12-26 23:43:47,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (1/1) ... [2019-12-26 23:43:47,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (1/1) ... [2019-12-26 23:43:47,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (1/1) ... [2019-12-26 23:43:47,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (1/1) ... [2019-12-26 23:43:47,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:43:47,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:43:47,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:43:47,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:43:47,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (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-26 23:43:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:43:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:43:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:43:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:43:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:43:48,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:43:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:43:48,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:43:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:43:48,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:43:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:43:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:43:48,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:43:48,011 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:43:48,763 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:43:48,763 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:43:48,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:48 BoogieIcfgContainer [2019-12-26 23:43:48,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:43:48,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:43:48,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:43:48,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:43:48,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:43:46" (1/3) ... [2019-12-26 23:43:48,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236498e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:48, skipping insertion in model container [2019-12-26 23:43:48,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:47" (2/3) ... [2019-12-26 23:43:48,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236498e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:48, skipping insertion in model container [2019-12-26 23:43:48,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:48" (3/3) ... [2019-12-26 23:43:48,777 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_rmo.oepc.i [2019-12-26 23:43:48,794 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:43:48,794 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:43:48,804 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:43:48,805 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:43:48,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,931 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,931 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:48,972 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:43:48,989 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:43:48,989 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:43:48,989 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:43:48,989 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:43:48,990 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:43:48,990 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:43:48,990 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:43:48,990 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:43:49,004 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-26 23:43:49,006 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:43:49,104 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:43:49,104 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:49,119 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 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:49,144 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:43:49,194 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:43:49,194 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:49,201 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 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:49,220 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 23:43:49,221 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:43:54,786 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:43:54,908 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:43:55,011 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-26 23:43:55,011 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:43:55,015 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-26 23:44:06,704 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-26 23:44:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-26 23:44:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:44:06,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:06,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:44:06,714 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-26 23:44:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-26 23:44:06,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:06,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397923173] [2019-12-26 23:44:06,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:06,934 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-26 23:44:06,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397923173] [2019-12-26 23:44:06,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:06,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:44:06,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056213558] [2019-12-26 23:44:06,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:44:06,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:06,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:44:06,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:06,953 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-26 23:44:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:10,137 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-26 23:44:10,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:44:10,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:44:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:10,702 INFO L225 Difference]: With dead ends: 85012 [2019-12-26 23:44:10,702 INFO L226 Difference]: Without dead ends: 80140 [2019-12-26 23:44:10,706 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-26 23:44:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-26 23:44:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-26 23:44:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-26 23:44:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-26 23:44:17,861 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-26 23:44:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:17,861 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-26 23:44:17,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:44:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-26 23:44:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:44:17,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:17,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:17,872 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-26 23:44:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-26 23:44:17,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:17,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284907703] [2019-12-26 23:44:17,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:17,975 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-26 23:44:17,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284907703] [2019-12-26 23:44:17,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:17,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:17,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729299787] [2019-12-26 23:44:17,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:17,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:17,979 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-26 23:44:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:22,279 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-26 23:44:22,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:22,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:44:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:22,925 INFO L225 Difference]: With dead ends: 123388 [2019-12-26 23:44:22,925 INFO L226 Difference]: Without dead ends: 123290 [2019-12-26 23:44:22,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-26 23:44:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-26 23:44:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-26 23:44:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-26 23:44:29,824 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-26 23:44:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:29,825 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-26 23:44:29,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-26 23:44:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:44:29,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:29,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:29,829 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-26 23:44:29,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-26 23:44:29,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:29,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846555800] [2019-12-26 23:44:29,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:29,913 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-26 23:44:29,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846555800] [2019-12-26 23:44:29,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:29,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:29,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059359489] [2019-12-26 23:44:29,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:29,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:29,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:29,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:29,917 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-26 23:44:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:35,377 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-26 23:44:35,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:35,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:44:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:35,924 INFO L225 Difference]: With dead ends: 159677 [2019-12-26 23:44:35,924 INFO L226 Difference]: Without dead ends: 159565 [2019-12-26 23:44:35,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-26 23:44:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-26 23:44:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-26 23:44:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-26 23:44:43,004 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-26 23:44:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:43,005 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-26 23:44:43,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-26 23:44:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:43,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:43,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:43,010 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-26 23:44:43,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:43,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-26 23:44:43,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:43,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782004037] [2019-12-26 23:44:43,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:43,100 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-26 23:44:43,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782004037] [2019-12-26 23:44:43,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:43,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:44:43,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101212747] [2019-12-26 23:44:43,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:44:43,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:43,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:44:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:43,105 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-26 23:44:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:44,005 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-26 23:44:44,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:44:44,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 23:44:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:50,811 INFO L225 Difference]: With dead ends: 181618 [2019-12-26 23:44:50,811 INFO L226 Difference]: Without dead ends: 181618 [2019-12-26 23:44:50,812 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-26 23:44:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-26 23:44:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-26 23:44:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-26 23:44:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-26 23:44:58,039 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-26 23:44:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:58,039 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-26 23:44:58,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:44:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-26 23:44:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:58,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:58,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:58,043 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-26 23:44:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-26 23:44:58,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:58,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881723076] [2019-12-26 23:44:58,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:58,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-26 23:44:58,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881723076] [2019-12-26 23:44:58,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:58,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:58,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21140737] [2019-12-26 23:44:58,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:58,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:58,118 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-26 23:44:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:59,129 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-26 23:44:59,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:59,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:44:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:01,222 INFO L225 Difference]: With dead ends: 179622 [2019-12-26 23:45:01,222 INFO L226 Difference]: Without dead ends: 179542 [2019-12-26 23:45:01,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-26 23:45:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-26 23:45:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-26 23:45:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-26 23:45:14,924 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-26 23:45:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:14,925 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-26 23:45:14,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-26 23:45:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:45:14,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:14,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:14,930 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-26 23:45:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:14,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-26 23:45:14,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:14,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840532837] [2019-12-26 23:45:14,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:14,998 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-26 23:45:14,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840532837] [2019-12-26 23:45:14,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:14,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:15,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675091893] [2019-12-26 23:45:15,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:15,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:15,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:15,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:15,002 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-26 23:45:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:17,271 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-26 23:45:17,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:45:17,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:45:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:17,916 INFO L225 Difference]: With dead ends: 189091 [2019-12-26 23:45:17,916 INFO L226 Difference]: Without dead ends: 188995 [2019-12-26 23:45:17,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-26 23:45:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-26 23:45:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-26 23:45:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-26 23:45:31,656 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-26 23:45:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:31,656 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-26 23:45:31,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-26 23:45:31,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:45:31,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:31,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:31,677 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-26 23:45:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:31,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-26 23:45:31,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:31,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783582165] [2019-12-26 23:45:31,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:31,725 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-26 23:45:31,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783582165] [2019-12-26 23:45:31,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:31,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:45:31,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573298166] [2019-12-26 23:45:31,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:31,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:31,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:31,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:31,727 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-26 23:45:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:38,221 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-26 23:45:38,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:38,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 23:45:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:38,709 INFO L225 Difference]: With dead ends: 160940 [2019-12-26 23:45:38,709 INFO L226 Difference]: Without dead ends: 160940 [2019-12-26 23:45:38,710 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-26 23:45:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-26 23:45:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-26 23:45:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-26 23:45:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-26 23:45:45,491 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-26 23:45:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:45,491 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-26 23:45:45,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-26 23:45:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:45:45,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:45,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:45,510 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-26 23:45:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-26 23:45:45,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:45,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729284034] [2019-12-26 23:45:45,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:45,567 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-26 23:45:45,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729284034] [2019-12-26 23:45:45,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:45,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:45,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840686875] [2019-12-26 23:45:45,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:45,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:45,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:45,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:45,569 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-26 23:45:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:48,052 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-26 23:45:48,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:48,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:45:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:55,816 INFO L225 Difference]: With dead ends: 255238 [2019-12-26 23:45:55,816 INFO L226 Difference]: Without dead ends: 128270 [2019-12-26 23:45:55,817 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-26 23:45:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-26 23:46:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-26 23:46:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-26 23:46:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-26 23:46:01,987 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-26 23:46:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:01,987 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-26 23:46:01,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:46:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-26 23:46:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:46:02,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:02,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:02,002 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-26 23:46:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:02,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-26 23:46:02,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:02,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364798007] [2019-12-26 23:46:02,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:02,079 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-26 23:46:02,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364798007] [2019-12-26 23:46:02,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:02,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:02,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760045119] [2019-12-26 23:46:02,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:46:02,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:02,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:46:02,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:46:02,081 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 4 states. [2019-12-26 23:46:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:02,273 INFO L93 Difference]: Finished difference Result 36423 states and 125388 transitions. [2019-12-26 23:46:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:46:02,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:46:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:02,327 INFO L225 Difference]: With dead ends: 36423 [2019-12-26 23:46:02,327 INFO L226 Difference]: Without dead ends: 28545 [2019-12-26 23:46:02,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28545 states. [2019-12-26 23:46:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28545 to 28545. [2019-12-26 23:46:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-26 23:46:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-26 23:46:02,842 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-26 23:46:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:02,842 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-26 23:46:02,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:46:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-26 23:46:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:46:02,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:02,849 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-26 23:46:02,849 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-26 23:46:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:02,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-26 23:46:02,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:02,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374796044] [2019-12-26 23:46:02,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:02,911 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-26 23:46:02,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374796044] [2019-12-26 23:46:02,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:02,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:02,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070941908] [2019-12-26 23:46:02,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:02,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:02,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:02,913 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 5 states. [2019-12-26 23:46:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:03,357 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-26 23:46:03,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:46:03,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:46:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:03,423 INFO L225 Difference]: With dead ends: 37265 [2019-12-26 23:46:03,423 INFO L226 Difference]: Without dead ends: 36963 [2019-12-26 23:46:03,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:46:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-26 23:46:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-26 23:46:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-26 23:46:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-26 23:46:05,941 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-26 23:46:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:05,941 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-26 23:46:05,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-26 23:46:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:46:05,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:05,947 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-26 23:46:05,948 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-26 23:46:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-26 23:46:05,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:05,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338652185] [2019-12-26 23:46:05,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:06,000 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-26 23:46:06,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338652185] [2019-12-26 23:46:06,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:06,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:06,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125299935] [2019-12-26 23:46:06,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:06,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:06,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:06,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:06,002 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 5 states. [2019-12-26 23:46:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:06,448 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-26 23:46:06,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:46:06,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:46:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:06,507 INFO L225 Difference]: With dead ends: 37362 [2019-12-26 23:46:06,507 INFO L226 Difference]: Without dead ends: 36942 [2019-12-26 23:46:06,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:46:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-26 23:46:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-26 23:46:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-26 23:46:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-26 23:46:07,051 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-26 23:46:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:07,051 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-26 23:46:07,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-26 23:46:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:46:07,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:07,060 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-26 23:46:07,060 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-26 23:46:07,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-26 23:46:07,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:07,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435239648] [2019-12-26 23:46:07,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:07,131 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-26 23:46:07,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435239648] [2019-12-26 23:46:07,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:07,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:07,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69229557] [2019-12-26 23:46:07,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:07,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:07,133 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-26 23:46:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:07,445 INFO L93 Difference]: Finished difference Result 28874 states and 95112 transitions. [2019-12-26 23:46:07,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:46:07,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 23:46:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:07,835 INFO L225 Difference]: With dead ends: 28874 [2019-12-26 23:46:07,835 INFO L226 Difference]: Without dead ends: 28434 [2019-12-26 23:46:07,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2019-12-26 23:46:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28291. [2019-12-26 23:46:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28291 states. [2019-12-26 23:46:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28291 states to 28291 states and 93821 transitions. [2019-12-26 23:46:08,301 INFO L78 Accepts]: Start accepts. Automaton has 28291 states and 93821 transitions. Word has length 25 [2019-12-26 23:46:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:08,301 INFO L462 AbstractCegarLoop]: Abstraction has 28291 states and 93821 transitions. [2019-12-26 23:46:08,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 28291 states and 93821 transitions. [2019-12-26 23:46:08,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:46:08,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:08,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:08,316 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-26 23:46:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:08,316 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-26 23:46:08,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:08,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769278336] [2019-12-26 23:46:08,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:08,381 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-26 23:46:08,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769278336] [2019-12-26 23:46:08,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:08,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:08,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599459187] [2019-12-26 23:46:08,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:08,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:08,383 INFO L87 Difference]: Start difference. First operand 28291 states and 93821 transitions. Second operand 5 states. [2019-12-26 23:46:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:08,792 INFO L93 Difference]: Finished difference Result 37145 states and 121294 transitions. [2019-12-26 23:46:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:46:08,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:46:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:08,859 INFO L225 Difference]: With dead ends: 37145 [2019-12-26 23:46:08,859 INFO L226 Difference]: Without dead ends: 36771 [2019-12-26 23:46:08,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36771 states. [2019-12-26 23:46:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36771 to 29755. [2019-12-26 23:46:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-26 23:46:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 98514 transitions. [2019-12-26 23:46:09,424 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 98514 transitions. Word has length 28 [2019-12-26 23:46:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:09,425 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 98514 transitions. [2019-12-26 23:46:09,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 98514 transitions. [2019-12-26 23:46:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:46:09,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:09,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:09,804 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-26 23:46:09,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:09,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-26 23:46:09,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:09,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445165340] [2019-12-26 23:46:09,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:09,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445165340] [2019-12-26 23:46:09,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:09,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:09,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455719081] [2019-12-26 23:46:09,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:09,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:09,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:09,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:09,852 INFO L87 Difference]: Start difference. First operand 29755 states and 98514 transitions. Second operand 3 states. [2019-12-26 23:46:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:10,044 INFO L93 Difference]: Finished difference Result 38320 states and 126138 transitions. [2019-12-26 23:46:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:10,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-26 23:46:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:10,108 INFO L225 Difference]: With dead ends: 38320 [2019-12-26 23:46:10,108 INFO L226 Difference]: Without dead ends: 38320 [2019-12-26 23:46:10,108 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-26 23:46:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38320 states. [2019-12-26 23:46:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38320 to 30661. [2019-12-26 23:46:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30661 states. [2019-12-26 23:46:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30661 states to 30661 states and 100227 transitions. [2019-12-26 23:46:10,655 INFO L78 Accepts]: Start accepts. Automaton has 30661 states and 100227 transitions. Word has length 28 [2019-12-26 23:46:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:10,655 INFO L462 AbstractCegarLoop]: Abstraction has 30661 states and 100227 transitions. [2019-12-26 23:46:10,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 30661 states and 100227 transitions. [2019-12-26 23:46:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:46:10,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:10,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:10,672 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-26 23:46:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:10,672 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-26 23:46:10,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:10,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979522296] [2019-12-26 23:46:10,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:10,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979522296] [2019-12-26 23:46:10,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:10,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:10,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092008833] [2019-12-26 23:46:10,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:10,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:10,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:10,732 INFO L87 Difference]: Start difference. First operand 30661 states and 100227 transitions. Second operand 5 states. [2019-12-26 23:46:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:11,112 INFO L93 Difference]: Finished difference Result 39205 states and 126499 transitions. [2019-12-26 23:46:11,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:46:11,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 23:46:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:11,177 INFO L225 Difference]: With dead ends: 39205 [2019-12-26 23:46:11,177 INFO L226 Difference]: Without dead ends: 38811 [2019-12-26 23:46:11,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38811 states. [2019-12-26 23:46:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38811 to 30894. [2019-12-26 23:46:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30894 states. [2019-12-26 23:46:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30894 states to 30894 states and 100767 transitions. [2019-12-26 23:46:11,938 INFO L78 Accepts]: Start accepts. Automaton has 30894 states and 100767 transitions. Word has length 29 [2019-12-26 23:46:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:11,938 INFO L462 AbstractCegarLoop]: Abstraction has 30894 states and 100767 transitions. [2019-12-26 23:46:11,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 30894 states and 100767 transitions. [2019-12-26 23:46:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:46:11,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:11,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:11,952 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-26 23:46:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash 805904020, now seen corresponding path program 1 times [2019-12-26 23:46:11,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:11,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918668922] [2019-12-26 23:46:11,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:11,983 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-26 23:46:11,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918668922] [2019-12-26 23:46:11,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:11,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:11,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725490036] [2019-12-26 23:46:11,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:11,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:11,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:11,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:11,985 INFO L87 Difference]: Start difference. First operand 30894 states and 100767 transitions. Second operand 3 states. [2019-12-26 23:46:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:12,252 INFO L93 Difference]: Finished difference Result 49254 states and 162311 transitions. [2019-12-26 23:46:12,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:12,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-26 23:46:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:12,301 INFO L225 Difference]: With dead ends: 49254 [2019-12-26 23:46:12,301 INFO L226 Difference]: Without dead ends: 21429 [2019-12-26 23:46:12,302 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-26 23:46:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-26 23:46:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-26 23:46:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-26 23:46:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-26 23:46:12,713 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 29 [2019-12-26 23:46:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:12,713 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-26 23:46:12,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-26 23:46:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 23:46:12,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:12,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:12,723 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-26 23:46:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1673459084, now seen corresponding path program 1 times [2019-12-26 23:46:12,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:12,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19450003] [2019-12-26 23:46:12,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:12,793 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-26 23:46:12,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19450003] [2019-12-26 23:46:12,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:12,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:46:12,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337590125] [2019-12-26 23:46:12,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:12,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:12,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:12,795 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-26 23:46:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:13,454 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-26 23:46:13,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:46:13,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-26 23:46:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:13,534 INFO L225 Difference]: With dead ends: 34767 [2019-12-26 23:46:13,534 INFO L226 Difference]: Without dead ends: 34767 [2019-12-26 23:46:13,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-26 23:46:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-26 23:46:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-26 23:46:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-26 23:46:14,211 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-26 23:46:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:14,211 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-26 23:46:14,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-26 23:46:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 23:46:14,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:14,225 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] [2019-12-26 23:46:14,225 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-26 23:46:14,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1413309470, now seen corresponding path program 1 times [2019-12-26 23:46:14,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:14,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602934290] [2019-12-26 23:46:14,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:14,292 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-26 23:46:14,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602934290] [2019-12-26 23:46:14,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:14,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:46:14,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603836468] [2019-12-26 23:46:14,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:14,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:14,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:14,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:14,294 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-26 23:46:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:14,414 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-26 23:46:14,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:46:14,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 23:46:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:14,438 INFO L225 Difference]: With dead ends: 13178 [2019-12-26 23:46:14,439 INFO L226 Difference]: Without dead ends: 11110 [2019-12-26 23:46:14,442 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-26 23:46:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-26 23:46:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-26 23:46:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-26 23:46:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-26 23:46:14,707 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-26 23:46:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:14,708 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-26 23:46:14,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-26 23:46:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:14,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:14,725 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-26 23:46:14,725 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-26 23:46:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:14,725 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-26 23:46:14,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:14,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808382513] [2019-12-26 23:46:14,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:14,842 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-26 23:46:14,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808382513] [2019-12-26 23:46:14,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:14,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:46:14,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144718179] [2019-12-26 23:46:14,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:14,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:14,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:14,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:14,845 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-26 23:46:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:15,066 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-26 23:46:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:46:15,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:46:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:15,085 INFO L225 Difference]: With dead ends: 11069 [2019-12-26 23:46:15,085 INFO L226 Difference]: Without dead ends: 10842 [2019-12-26 23:46:15,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-26 23:46:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-26 23:46:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-26 23:46:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-26 23:46:15,237 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-26 23:46:15,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:15,237 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-26 23:46:15,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-26 23:46:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:15,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:15,251 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-26 23:46:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 1 times [2019-12-26 23:46:15,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:15,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700688684] [2019-12-26 23:46:15,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:15,331 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-26 23:46:15,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700688684] [2019-12-26 23:46:15,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:15,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:46:15,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052427098] [2019-12-26 23:46:15,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:15,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:15,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:15,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:15,333 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 6 states. [2019-12-26 23:46:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:16,059 INFO L93 Difference]: Finished difference Result 20964 states and 62804 transitions. [2019-12-26 23:46:16,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:46:16,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:46:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:16,088 INFO L225 Difference]: With dead ends: 20964 [2019-12-26 23:46:16,089 INFO L226 Difference]: Without dead ends: 20964 [2019-12-26 23:46:16,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20964 states. [2019-12-26 23:46:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20964 to 13761. [2019-12-26 23:46:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-26 23:46:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41473 transitions. [2019-12-26 23:46:16,437 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41473 transitions. Word has length 40 [2019-12-26 23:46:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:16,438 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41473 transitions. [2019-12-26 23:46:16,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41473 transitions. [2019-12-26 23:46:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:16,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:16,457 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-26 23:46:16,457 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-26 23:46:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:16,457 INFO L82 PathProgramCache]: Analyzing trace with hash 820794198, now seen corresponding path program 2 times [2019-12-26 23:46:16,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:16,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876673920] [2019-12-26 23:46:16,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:16,535 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-26 23:46:16,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876673920] [2019-12-26 23:46:16,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:16,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:16,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909707922] [2019-12-26 23:46:16,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:16,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:16,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:16,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:16,537 INFO L87 Difference]: Start difference. First operand 13761 states and 41473 transitions. Second operand 3 states. [2019-12-26 23:46:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:16,602 INFO L93 Difference]: Finished difference Result 13681 states and 41186 transitions. [2019-12-26 23:46:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:16,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 23:46:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:16,627 INFO L225 Difference]: With dead ends: 13681 [2019-12-26 23:46:16,627 INFO L226 Difference]: Without dead ends: 13681 [2019-12-26 23:46:16,628 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-26 23:46:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13681 states. [2019-12-26 23:46:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13681 to 11316. [2019-12-26 23:46:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11316 states. [2019-12-26 23:46:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11316 states to 11316 states and 34446 transitions. [2019-12-26 23:46:16,812 INFO L78 Accepts]: Start accepts. Automaton has 11316 states and 34446 transitions. Word has length 40 [2019-12-26 23:46:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:16,812 INFO L462 AbstractCegarLoop]: Abstraction has 11316 states and 34446 transitions. [2019-12-26 23:46:16,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 11316 states and 34446 transitions. [2019-12-26 23:46:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:46:16,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:16,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:16,824 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-26 23:46:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-26 23:46:16,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:16,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211121865] [2019-12-26 23:46:16,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:16,894 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-26 23:46:16,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211121865] [2019-12-26 23:46:16,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:16,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:46:16,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127583782] [2019-12-26 23:46:16,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:16,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:16,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:16,896 INFO L87 Difference]: Start difference. First operand 11316 states and 34446 transitions. Second operand 6 states. [2019-12-26 23:46:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:17,004 INFO L93 Difference]: Finished difference Result 10325 states and 32034 transitions. [2019-12-26 23:46:17,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:46:17,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:46:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:17,020 INFO L225 Difference]: With dead ends: 10325 [2019-12-26 23:46:17,020 INFO L226 Difference]: Without dead ends: 9901 [2019-12-26 23:46:17,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9901 states. [2019-12-26 23:46:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9901 to 9846. [2019-12-26 23:46:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2019-12-26 23:46:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31016 transitions. [2019-12-26 23:46:17,163 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31016 transitions. Word has length 41 [2019-12-26 23:46:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:17,163 INFO L462 AbstractCegarLoop]: Abstraction has 9846 states and 31016 transitions. [2019-12-26 23:46:17,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31016 transitions. [2019-12-26 23:46:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:17,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:17,176 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-26 23:46:17,176 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-26 23:46:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:17,176 INFO L82 PathProgramCache]: Analyzing trace with hash 92371973, now seen corresponding path program 1 times [2019-12-26 23:46:17,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:17,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807934040] [2019-12-26 23:46:17,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:17,269 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-26 23:46:17,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807934040] [2019-12-26 23:46:17,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:17,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:46:17,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949942812] [2019-12-26 23:46:17,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:46:17,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:17,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:46:17,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:46:17,271 INFO L87 Difference]: Start difference. First operand 9846 states and 31016 transitions. Second operand 8 states. [2019-12-26 23:46:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:18,026 INFO L93 Difference]: Finished difference Result 18711 states and 57563 transitions. [2019-12-26 23:46:18,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:46:18,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-26 23:46:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:18,047 INFO L225 Difference]: With dead ends: 18711 [2019-12-26 23:46:18,047 INFO L226 Difference]: Without dead ends: 13830 [2019-12-26 23:46:18,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:46:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-12-26 23:46:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 11317. [2019-12-26 23:46:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2019-12-26 23:46:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 35333 transitions. [2019-12-26 23:46:18,237 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 35333 transitions. Word has length 55 [2019-12-26 23:46:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:18,237 INFO L462 AbstractCegarLoop]: Abstraction has 11317 states and 35333 transitions. [2019-12-26 23:46:18,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:46:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 35333 transitions. [2019-12-26 23:46:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:18,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:46:18,250 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-26 23:46:18,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash 62198309, now seen corresponding path program 2 times [2019-12-26 23:46:18,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:18,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746866064] [2019-12-26 23:46:18,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:18,325 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-26 23:46:18,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746866064] [2019-12-26 23:46:18,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:18,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:46:18,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480422329] [2019-12-26 23:46:18,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:46:18,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:46:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:18,327 INFO L87 Difference]: Start difference. First operand 11317 states and 35333 transitions. Second operand 7 states. [2019-12-26 23:46:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:18,581 INFO L93 Difference]: Finished difference Result 19372 states and 59250 transitions. [2019-12-26 23:46:18,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:46:18,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-26 23:46:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:18,603 INFO L225 Difference]: With dead ends: 19372 [2019-12-26 23:46:18,603 INFO L226 Difference]: Without dead ends: 14143 [2019-12-26 23:46:18,604 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-26 23:46:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14143 states. [2019-12-26 23:46:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14143 to 13246. [2019-12-26 23:46:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13246 states. [2019-12-26 23:46:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13246 states to 13246 states and 40719 transitions. [2019-12-26 23:46:18,889 INFO L78 Accepts]: Start accepts. Automaton has 13246 states and 40719 transitions. Word has length 55 [2019-12-26 23:46:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:18,889 INFO L462 AbstractCegarLoop]: Abstraction has 13246 states and 40719 transitions. [2019-12-26 23:46:18,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:46:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 13246 states and 40719 transitions. [2019-12-26 23:46:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:18,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:18,905 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-26 23:46:18,905 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-26 23:46:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:18,905 INFO L82 PathProgramCache]: Analyzing trace with hash -435713207, now seen corresponding path program 3 times [2019-12-26 23:46:18,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:18,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877517262] [2019-12-26 23:46:18,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:18,969 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-26 23:46:18,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877517262] [2019-12-26 23:46:18,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:18,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:46:18,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282174677] [2019-12-26 23:46:18,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:46:18,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:46:18,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:18,971 INFO L87 Difference]: Start difference. First operand 13246 states and 40719 transitions. Second operand 7 states. [2019-12-26 23:46:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:19,220 INFO L93 Difference]: Finished difference Result 20485 states and 61956 transitions. [2019-12-26 23:46:19,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:46:19,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-26 23:46:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:19,244 INFO L225 Difference]: With dead ends: 20485 [2019-12-26 23:46:19,244 INFO L226 Difference]: Without dead ends: 15613 [2019-12-26 23:46:19,244 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-26 23:46:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15613 states. [2019-12-26 23:46:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15613 to 13283. [2019-12-26 23:46:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13283 states. [2019-12-26 23:46:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13283 states to 13283 states and 40785 transitions. [2019-12-26 23:46:19,453 INFO L78 Accepts]: Start accepts. Automaton has 13283 states and 40785 transitions. Word has length 55 [2019-12-26 23:46:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:19,454 INFO L462 AbstractCegarLoop]: Abstraction has 13283 states and 40785 transitions. [2019-12-26 23:46:19,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:46:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 13283 states and 40785 transitions. [2019-12-26 23:46:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:19,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:19,468 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-26 23:46:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:19,469 INFO L82 PathProgramCache]: Analyzing trace with hash -808118167, now seen corresponding path program 4 times [2019-12-26 23:46:19,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:19,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139547820] [2019-12-26 23:46:19,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:19,574 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-26 23:46:19,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139547820] [2019-12-26 23:46:19,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:19,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:46:19,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944919810] [2019-12-26 23:46:19,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:46:19,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:19,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:46:19,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:19,576 INFO L87 Difference]: Start difference. First operand 13283 states and 40785 transitions. Second operand 9 states. [2019-12-26 23:46:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:20,491 INFO L93 Difference]: Finished difference Result 23536 states and 71056 transitions. [2019-12-26 23:46:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:46:20,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-26 23:46:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:20,533 INFO L225 Difference]: With dead ends: 23536 [2019-12-26 23:46:20,533 INFO L226 Difference]: Without dead ends: 22230 [2019-12-26 23:46:20,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:46:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22230 states. [2019-12-26 23:46:20,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22230 to 13143. [2019-12-26 23:46:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13143 states. [2019-12-26 23:46:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13143 states to 13143 states and 40364 transitions. [2019-12-26 23:46:20,894 INFO L78 Accepts]: Start accepts. Automaton has 13143 states and 40364 transitions. Word has length 55 [2019-12-26 23:46:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:20,894 INFO L462 AbstractCegarLoop]: Abstraction has 13143 states and 40364 transitions. [2019-12-26 23:46:20,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:46:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 13143 states and 40364 transitions. [2019-12-26 23:46:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:20,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:20,910 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-26 23:46:20,911 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-26 23:46:20,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:20,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2126472303, now seen corresponding path program 5 times [2019-12-26 23:46:20,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:20,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209506076] [2019-12-26 23:46:20,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:21,006 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-26 23:46:21,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209506076] [2019-12-26 23:46:21,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:21,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:46:21,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083970855] [2019-12-26 23:46:21,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:46:21,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:21,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:46:21,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:21,008 INFO L87 Difference]: Start difference. First operand 13143 states and 40364 transitions. Second operand 9 states. [2019-12-26 23:46:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:22,212 INFO L93 Difference]: Finished difference Result 31376 states and 94703 transitions. [2019-12-26 23:46:22,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:46:22,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-26 23:46:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:22,270 INFO L225 Difference]: With dead ends: 31376 [2019-12-26 23:46:22,270 INFO L226 Difference]: Without dead ends: 30134 [2019-12-26 23:46:22,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:46:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30134 states. [2019-12-26 23:46:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30134 to 13164. [2019-12-26 23:46:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13164 states. [2019-12-26 23:46:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 40462 transitions. [2019-12-26 23:46:22,582 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 40462 transitions. Word has length 55 [2019-12-26 23:46:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:22,582 INFO L462 AbstractCegarLoop]: Abstraction has 13164 states and 40462 transitions. [2019-12-26 23:46:22,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:46:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 40462 transitions. [2019-12-26 23:46:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:22,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:22,598 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-26 23:46:22,598 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-26 23:46:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:22,598 INFO L82 PathProgramCache]: Analyzing trace with hash -655607069, now seen corresponding path program 6 times [2019-12-26 23:46:22,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:22,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692062379] [2019-12-26 23:46:22,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:22,652 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-26 23:46:22,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692062379] [2019-12-26 23:46:22,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:22,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:22,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990927351] [2019-12-26 23:46:22,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:22,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:22,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:22,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:22,654 INFO L87 Difference]: Start difference. First operand 13164 states and 40462 transitions. Second operand 3 states. [2019-12-26 23:46:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:22,696 INFO L93 Difference]: Finished difference Result 8642 states and 26236 transitions. [2019-12-26 23:46:22,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:22,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 23:46:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:22,711 INFO L225 Difference]: With dead ends: 8642 [2019-12-26 23:46:22,711 INFO L226 Difference]: Without dead ends: 8642 [2019-12-26 23:46:22,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8642 states. [2019-12-26 23:46:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8642 to 8482. [2019-12-26 23:46:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8482 states. [2019-12-26 23:46:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8482 states to 8482 states and 25789 transitions. [2019-12-26 23:46:22,956 INFO L78 Accepts]: Start accepts. Automaton has 8482 states and 25789 transitions. Word has length 55 [2019-12-26 23:46:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:22,956 INFO L462 AbstractCegarLoop]: Abstraction has 8482 states and 25789 transitions. [2019-12-26 23:46:22,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8482 states and 25789 transitions. [2019-12-26 23:46:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:22,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:22,973 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-26 23:46:22,973 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:22,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-26 23:46:22,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:22,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26680512] [2019-12-26 23:46:22,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:23,555 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-26 23:46:23,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26680512] [2019-12-26 23:46:23,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:23,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:46:23,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888242219] [2019-12-26 23:46:23,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:46:23,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:23,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:46:23,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:46:23,558 INFO L87 Difference]: Start difference. First operand 8482 states and 25789 transitions. Second operand 16 states. [2019-12-26 23:46:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:26,657 INFO L93 Difference]: Finished difference Result 14824 states and 44071 transitions. [2019-12-26 23:46:26,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-26 23:46:26,657 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-26 23:46:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:26,677 INFO L225 Difference]: With dead ends: 14824 [2019-12-26 23:46:26,677 INFO L226 Difference]: Without dead ends: 12302 [2019-12-26 23:46:26,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=404, Invalid=1666, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 23:46:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12302 states. [2019-12-26 23:46:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12302 to 9088. [2019-12-26 23:46:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2019-12-26 23:46:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 27362 transitions. [2019-12-26 23:46:26,908 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 27362 transitions. Word has length 56 [2019-12-26 23:46:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:26,909 INFO L462 AbstractCegarLoop]: Abstraction has 9088 states and 27362 transitions. [2019-12-26 23:46:26,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:46:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 27362 transitions. [2019-12-26 23:46:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:26,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:26,920 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-26 23:46:26,920 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1049666311, now seen corresponding path program 2 times [2019-12-26 23:46:26,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:26,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822744569] [2019-12-26 23:46:26,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:27,372 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-26 23:46:27,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822744569] [2019-12-26 23:46:27,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:27,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:46:27,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333235954] [2019-12-26 23:46:27,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:46:27,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:46:27,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:46:27,374 INFO L87 Difference]: Start difference. First operand 9088 states and 27362 transitions. Second operand 16 states. [2019-12-26 23:46:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:30,304 INFO L93 Difference]: Finished difference Result 13929 states and 41244 transitions. [2019-12-26 23:46:30,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-26 23:46:30,304 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-26 23:46:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:30,321 INFO L225 Difference]: With dead ends: 13929 [2019-12-26 23:46:30,321 INFO L226 Difference]: Without dead ends: 12035 [2019-12-26 23:46:30,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1820, Unknown=0, NotChecked=0, Total=2256 [2019-12-26 23:46:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12035 states. [2019-12-26 23:46:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12035 to 9040. [2019-12-26 23:46:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9040 states. [2019-12-26 23:46:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9040 states to 9040 states and 27238 transitions. [2019-12-26 23:46:30,475 INFO L78 Accepts]: Start accepts. Automaton has 9040 states and 27238 transitions. Word has length 56 [2019-12-26 23:46:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:30,476 INFO L462 AbstractCegarLoop]: Abstraction has 9040 states and 27238 transitions. [2019-12-26 23:46:30,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:46:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9040 states and 27238 transitions. [2019-12-26 23:46:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:30,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:30,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:30,485 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:30,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash -337997383, now seen corresponding path program 3 times [2019-12-26 23:46:30,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:30,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242753164] [2019-12-26 23:46:30,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:30,981 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-26 23:46:30,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242753164] [2019-12-26 23:46:30,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:30,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:46:30,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285804441] [2019-12-26 23:46:30,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:46:30,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:46:30,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:46:30,983 INFO L87 Difference]: Start difference. First operand 9040 states and 27238 transitions. Second operand 16 states. [2019-12-26 23:46:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:34,082 INFO L93 Difference]: Finished difference Result 16814 states and 49719 transitions. [2019-12-26 23:46:34,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-26 23:46:34,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-26 23:46:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:34,102 INFO L225 Difference]: With dead ends: 16814 [2019-12-26 23:46:34,102 INFO L226 Difference]: Without dead ends: 12855 [2019-12-26 23:46:34,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2019-12-26 23:46:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12855 states. [2019-12-26 23:46:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12855 to 9451. [2019-12-26 23:46:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9451 states. [2019-12-26 23:46:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9451 states to 9451 states and 28254 transitions. [2019-12-26 23:46:34,254 INFO L78 Accepts]: Start accepts. Automaton has 9451 states and 28254 transitions. Word has length 56 [2019-12-26 23:46:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:34,254 INFO L462 AbstractCegarLoop]: Abstraction has 9451 states and 28254 transitions. [2019-12-26 23:46:34,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:46:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 9451 states and 28254 transitions. [2019-12-26 23:46:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:34,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:34,264 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-26 23:46:34,264 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash 65039161, now seen corresponding path program 4 times [2019-12-26 23:46:34,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:34,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199770157] [2019-12-26 23:46:34,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:34,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199770157] [2019-12-26 23:46:34,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:34,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:46:34,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191465934] [2019-12-26 23:46:34,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:46:34,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:46:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:46:34,732 INFO L87 Difference]: Start difference. First operand 9451 states and 28254 transitions. Second operand 16 states. [2019-12-26 23:46:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:38,262 INFO L93 Difference]: Finished difference Result 15811 states and 46250 transitions. [2019-12-26 23:46:38,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-26 23:46:38,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-26 23:46:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:38,281 INFO L225 Difference]: With dead ends: 15811 [2019-12-26 23:46:38,282 INFO L226 Difference]: Without dead ends: 12838 [2019-12-26 23:46:38,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=1974, Unknown=0, NotChecked=0, Total=2352 [2019-12-26 23:46:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12838 states. [2019-12-26 23:46:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12838 to 9388. [2019-12-26 23:46:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9388 states. [2019-12-26 23:46:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9388 states to 9388 states and 27956 transitions. [2019-12-26 23:46:38,434 INFO L78 Accepts]: Start accepts. Automaton has 9388 states and 27956 transitions. Word has length 56 [2019-12-26 23:46:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:38,435 INFO L462 AbstractCegarLoop]: Abstraction has 9388 states and 27956 transitions. [2019-12-26 23:46:38,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:46:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 9388 states and 27956 transitions. [2019-12-26 23:46:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:38,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:38,444 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-26 23:46:38,444 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash 93841739, now seen corresponding path program 5 times [2019-12-26 23:46:38,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:38,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462348483] [2019-12-26 23:46:38,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:39,194 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-26 23:46:39,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462348483] [2019-12-26 23:46:39,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:39,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:46:39,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198361089] [2019-12-26 23:46:39,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:46:39,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:46:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:46:39,196 INFO L87 Difference]: Start difference. First operand 9388 states and 27956 transitions. Second operand 17 states. [2019-12-26 23:46:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:41,526 INFO L93 Difference]: Finished difference Result 14948 states and 43802 transitions. [2019-12-26 23:46:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-26 23:46:41,526 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-26 23:46:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:41,544 INFO L225 Difference]: With dead ends: 14948 [2019-12-26 23:46:41,545 INFO L226 Difference]: Without dead ends: 12970 [2019-12-26 23:46:41,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=350, Invalid=1456, Unknown=0, NotChecked=0, Total=1806 [2019-12-26 23:46:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2019-12-26 23:46:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 9598. [2019-12-26 23:46:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9598 states. [2019-12-26 23:46:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 28497 transitions. [2019-12-26 23:46:41,699 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 28497 transitions. Word has length 56 [2019-12-26 23:46:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:41,699 INFO L462 AbstractCegarLoop]: Abstraction has 9598 states and 28497 transitions. [2019-12-26 23:46:41,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:46:41,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 28497 transitions. [2019-12-26 23:46:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:41,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:41,709 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-26 23:46:41,710 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash 496878283, now seen corresponding path program 6 times [2019-12-26 23:46:41,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:41,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406921654] [2019-12-26 23:46:41,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:42,280 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-26 23:46:42,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406921654] [2019-12-26 23:46:42,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:42,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:46:42,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993748958] [2019-12-26 23:46:42,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:46:42,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:46:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:46:42,286 INFO L87 Difference]: Start difference. First operand 9598 states and 28497 transitions. Second operand 17 states. [2019-12-26 23:46:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:45,322 INFO L93 Difference]: Finished difference Result 14694 states and 42853 transitions. [2019-12-26 23:46:45,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-26 23:46:45,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-26 23:46:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:45,341 INFO L225 Difference]: With dead ends: 14694 [2019-12-26 23:46:45,342 INFO L226 Difference]: Without dead ends: 13132 [2019-12-26 23:46:45,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 23:46:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13132 states. [2019-12-26 23:46:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13132 to 9472. [2019-12-26 23:46:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9472 states. [2019-12-26 23:46:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9472 states to 9472 states and 28168 transitions. [2019-12-26 23:46:45,557 INFO L78 Accepts]: Start accepts. Automaton has 9472 states and 28168 transitions. Word has length 56 [2019-12-26 23:46:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:45,557 INFO L462 AbstractCegarLoop]: Abstraction has 9472 states and 28168 transitions. [2019-12-26 23:46:45,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:46:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 9472 states and 28168 transitions. [2019-12-26 23:46:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:45,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:45,566 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-26 23:46:45,567 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash 322223639, now seen corresponding path program 7 times [2019-12-26 23:46:45,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:45,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257368693] [2019-12-26 23:46:45,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:46,071 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-26 23:46:46,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257368693] [2019-12-26 23:46:46,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:46,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:46:46,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33083113] [2019-12-26 23:46:46,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:46:46,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:46,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:46:46,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:46:46,072 INFO L87 Difference]: Start difference. First operand 9472 states and 28168 transitions. Second operand 17 states. [2019-12-26 23:46:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:49,122 INFO L93 Difference]: Finished difference Result 14382 states and 41987 transitions. [2019-12-26 23:46:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-26 23:46:49,122 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-26 23:46:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:49,141 INFO L225 Difference]: With dead ends: 14382 [2019-12-26 23:46:49,141 INFO L226 Difference]: Without dead ends: 13112 [2019-12-26 23:46:49,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1547, Unknown=0, NotChecked=0, Total=1892 [2019-12-26 23:46:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13112 states. [2019-12-26 23:46:49,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13112 to 9416. [2019-12-26 23:46:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9416 states. [2019-12-26 23:46:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9416 states to 9416 states and 28009 transitions. [2019-12-26 23:46:49,295 INFO L78 Accepts]: Start accepts. Automaton has 9416 states and 28009 transitions. Word has length 56 [2019-12-26 23:46:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:49,295 INFO L462 AbstractCegarLoop]: Abstraction has 9416 states and 28009 transitions. [2019-12-26 23:46:49,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:46:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9416 states and 28009 transitions. [2019-12-26 23:46:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:49,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:49,308 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-26 23:46:49,308 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1592890399, now seen corresponding path program 8 times [2019-12-26 23:46:49,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:49,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921656605] [2019-12-26 23:46:49,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:49,679 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-26 23:46:49,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921656605] [2019-12-26 23:46:49,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:49,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:46:49,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290396877] [2019-12-26 23:46:49,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 23:46:49,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:49,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 23:46:49,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:46:49,680 INFO L87 Difference]: Start difference. First operand 9416 states and 28009 transitions. Second operand 15 states. [2019-12-26 23:46:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:52,955 INFO L93 Difference]: Finished difference Result 14162 states and 41450 transitions. [2019-12-26 23:46:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-26 23:46:52,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-26 23:46:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:52,971 INFO L225 Difference]: With dead ends: 14162 [2019-12-26 23:46:52,971 INFO L226 Difference]: Without dead ends: 10992 [2019-12-26 23:46:52,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=496, Invalid=2584, Unknown=0, NotChecked=0, Total=3080 [2019-12-26 23:46:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10992 states. [2019-12-26 23:46:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10992 to 8998. [2019-12-26 23:46:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8998 states. [2019-12-26 23:46:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8998 states to 8998 states and 26924 transitions. [2019-12-26 23:46:53,111 INFO L78 Accepts]: Start accepts. Automaton has 8998 states and 26924 transitions. Word has length 56 [2019-12-26 23:46:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:53,112 INFO L462 AbstractCegarLoop]: Abstraction has 8998 states and 26924 transitions. [2019-12-26 23:46:53,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 23:46:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 8998 states and 26924 transitions. [2019-12-26 23:46:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:53,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:53,121 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-26 23:46:53,121 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1355287643, now seen corresponding path program 9 times [2019-12-26 23:46:53,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:53,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968317379] [2019-12-26 23:46:53,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:53,216 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-26 23:46:53,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968317379] [2019-12-26 23:46:53,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:53,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:46:53,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137085754] [2019-12-26 23:46:53,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:46:53,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:46:53,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:53,218 INFO L87 Difference]: Start difference. First operand 8998 states and 26924 transitions. Second operand 9 states. [2019-12-26 23:46:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:54,023 INFO L93 Difference]: Finished difference Result 13918 states and 41128 transitions. [2019-12-26 23:46:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:46:54,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-26 23:46:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:54,038 INFO L225 Difference]: With dead ends: 13918 [2019-12-26 23:46:54,038 INFO L226 Difference]: Without dead ends: 10160 [2019-12-26 23:46:54,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:46:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10160 states. [2019-12-26 23:46:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10160 to 8896. [2019-12-26 23:46:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8896 states. [2019-12-26 23:46:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8896 states to 8896 states and 26571 transitions. [2019-12-26 23:46:54,177 INFO L78 Accepts]: Start accepts. Automaton has 8896 states and 26571 transitions. Word has length 56 [2019-12-26 23:46:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:54,177 INFO L462 AbstractCegarLoop]: Abstraction has 8896 states and 26571 transitions. [2019-12-26 23:46:54,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:46:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 8896 states and 26571 transitions. [2019-12-26 23:46:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:54,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:54,186 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-26 23:46:54,186 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1406091659, now seen corresponding path program 10 times [2019-12-26 23:46:54,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:54,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216485777] [2019-12-26 23:46:54,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:54,313 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-26 23:46:54,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216485777] [2019-12-26 23:46:54,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:54,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:46:54,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799046705] [2019-12-26 23:46:54,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:46:54,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:54,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:46:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:46:54,315 INFO L87 Difference]: Start difference. First operand 8896 states and 26571 transitions. Second operand 11 states. [2019-12-26 23:46:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:55,008 INFO L93 Difference]: Finished difference Result 11792 states and 34822 transitions. [2019-12-26 23:46:55,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:46:55,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-26 23:46:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:55,022 INFO L225 Difference]: With dead ends: 11792 [2019-12-26 23:46:55,022 INFO L226 Difference]: Without dead ends: 8974 [2019-12-26 23:46:55,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:46:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8974 states. [2019-12-26 23:46:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8974 to 8212. [2019-12-26 23:46:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8212 states. [2019-12-26 23:46:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8212 states to 8212 states and 24651 transitions. [2019-12-26 23:46:55,144 INFO L78 Accepts]: Start accepts. Automaton has 8212 states and 24651 transitions. Word has length 56 [2019-12-26 23:46:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:55,144 INFO L462 AbstractCegarLoop]: Abstraction has 8212 states and 24651 transitions. [2019-12-26 23:46:55,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:46:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 8212 states and 24651 transitions. [2019-12-26 23:46:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:55,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:55,153 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-26 23:46:55,153 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:55,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:55,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 11 times [2019-12-26 23:46:55,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:55,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094616542] [2019-12-26 23:46:55,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:55,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:46:55,252 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:46:55,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2085~0.base_30|) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= |v_ULTIMATE.start_main_~#t2085~0.offset_22| 0) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2085~0.base_30|) 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2085~0.base_30| 4)) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2085~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2085~0.base_30|) |v_ULTIMATE.start_main_~#t2085~0.offset_22| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2085~0.base_30| 1)) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ULTIMATE.start_main_~#t2087~0.base=|v_ULTIMATE.start_main_~#t2087~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2086~0.base=|v_ULTIMATE.start_main_~#t2086~0.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ULTIMATE.start_main_~#t2085~0.offset=|v_ULTIMATE.start_main_~#t2085~0.offset_22|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2085~0.base=|v_ULTIMATE.start_main_~#t2085~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ULTIMATE.start_main_~#t2087~0.offset=|v_ULTIMATE.start_main_~#t2087~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2086~0.offset=|v_ULTIMATE.start_main_~#t2086~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2085~0.offset, ULTIMATE.start_main_~#t2087~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #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, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2085~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2087~0.offset, ~x$w_buff1~0, ~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_~#t2086~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t2086~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:46:55,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2086~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2086~0.base_10| 4) |v_#length_15|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2086~0.base_10| 1) |v_#valid_31|) (= |v_ULTIMATE.start_main_~#t2086~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2086~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2086~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2086~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2086~0.base_10|) |v_ULTIMATE.start_main_~#t2086~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2086~0.offset=|v_ULTIMATE.start_main_~#t2086~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2086~0.base=|v_ULTIMATE.start_main_~#t2086~0.base_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2086~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2086~0.base, #length] because there is no mapped edge [2019-12-26 23:46:55,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:46:55,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2087~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2087~0.base_11|) |v_ULTIMATE.start_main_~#t2087~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2087~0.base_11| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2087~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2087~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2087~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2087~0.offset_10| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2087~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2087~0.base=|v_ULTIMATE.start_main_~#t2087~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2087~0.offset=|v_ULTIMATE.start_main_~#t2087~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2087~0.base, ULTIMATE.start_main_~#t2087~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 23:46:55,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In377576851 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In377576851 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In377576851 |P2Thread1of1ForFork1_#t~ite32_Out377576851|) (not .cse1)) (and (= ~x~0_In377576851 |P2Thread1of1ForFork1_#t~ite32_Out377576851|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In377576851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In377576851, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In377576851, ~x~0=~x~0_In377576851} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out377576851|, ~x$w_buff1~0=~x$w_buff1~0_In377576851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In377576851, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In377576851, ~x~0=~x~0_In377576851} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:46:55,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:46:55,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-400602548 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-400602548 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-400602548| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-400602548| ~x$w_buff0_used~0_In-400602548)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-400602548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-400602548} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-400602548|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-400602548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-400602548} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:46:55,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-774533209 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-774533209 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-774533209|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-774533209 |P1Thread1of1ForFork0_#t~ite28_Out-774533209|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-774533209, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-774533209} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-774533209, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-774533209|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-774533209} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:46:55,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-101851961 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-101851961 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-101851961 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-101851961 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-101851961| ~x$w_buff1_used~0_In-101851961) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-101851961| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-101851961, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-101851961, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-101851961, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-101851961} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-101851961, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-101851961, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-101851961, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-101851961|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-101851961} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:46:55,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1079998645 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1079998645 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out1079998645) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1079998645 ~x$r_buff0_thd2~0_Out1079998645)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1079998645, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1079998645} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1079998645|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1079998645, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1079998645} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:46:55,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1645077269 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1645077269 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1645077269 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1645077269 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1645077269| ~x$r_buff1_thd2~0_In1645077269) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1645077269|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1645077269, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1645077269, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1645077269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1645077269} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1645077269|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1645077269, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1645077269, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1645077269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1645077269} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:46:55,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, 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-26 23:46:55,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1741663042 256) 0))) (or (and (= ~x$w_buff0~0_In1741663042 |P0Thread1of1ForFork2_#t~ite9_Out1741663042|) (= |P0Thread1of1ForFork2_#t~ite8_In1741663042| |P0Thread1of1ForFork2_#t~ite8_Out1741663042|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out1741663042| |P0Thread1of1ForFork2_#t~ite9_Out1741663042|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1741663042 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1741663042 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1741663042 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1741663042 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite8_Out1741663042| ~x$w_buff0~0_In1741663042) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1741663042, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1741663042, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In1741663042|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1741663042, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1741663042, ~weak$$choice2~0=~weak$$choice2~0_In1741663042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741663042} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1741663042, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1741663042, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1741663042|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1741663042, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1741663042|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1741663042, ~weak$$choice2~0=~weak$$choice2~0_In1741663042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741663042} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:46:55,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In131453582 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In131453582 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In131453582 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In131453582 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In131453582 |P2Thread1of1ForFork1_#t~ite35_Out131453582|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite35_Out131453582| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In131453582, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In131453582, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In131453582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131453582} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out131453582|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In131453582, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In131453582, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In131453582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131453582} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:46:55,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-2013443843 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2013443843 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In-2013443843 |P2Thread1of1ForFork1_#t~ite36_Out-2013443843|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-2013443843|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2013443843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2013443843} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2013443843|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2013443843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2013443843} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:46:55,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1356381221 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1356381221 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1356381221 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1356381221 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1356381221|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1356381221| ~x$r_buff1_thd3~0_In1356381221) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1356381221, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1356381221, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1356381221, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1356381221} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1356381221|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1356381221, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1356381221, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1356381221, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1356381221} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:46:55,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, 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-26 23:46:55,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2131424857 256) 0))) (or (and (= ~x$w_buff1_used~0_In-2131424857 |P0Thread1of1ForFork2_#t~ite18_Out-2131424857|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-2131424857| |P0Thread1of1ForFork2_#t~ite17_Out-2131424857|)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out-2131424857| |P0Thread1of1ForFork2_#t~ite17_Out-2131424857|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-2131424857 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-2131424857 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-2131424857 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2131424857 256))))) (= ~x$w_buff1_used~0_In-2131424857 |P0Thread1of1ForFork2_#t~ite17_Out-2131424857|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2131424857, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-2131424857|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2131424857, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2131424857, ~weak$$choice2~0=~weak$$choice2~0_In-2131424857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131424857} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2131424857, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-2131424857|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-2131424857|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2131424857, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2131424857, ~weak$$choice2~0=~weak$$choice2~0_In-2131424857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131424857} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:46:55,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 23:46:55,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-913593440 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-913593440 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-913593440 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-913593440 256)) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-913593440 256))))) .cse1 (= |P0Thread1of1ForFork2_#t~ite23_Out-913593440| |P0Thread1of1ForFork2_#t~ite24_Out-913593440|) (= ~x$r_buff1_thd1~0_In-913593440 |P0Thread1of1ForFork2_#t~ite23_Out-913593440|)) (and (= |P0Thread1of1ForFork2_#t~ite23_In-913593440| |P0Thread1of1ForFork2_#t~ite23_Out-913593440|) (not .cse1) (= ~x$r_buff1_thd1~0_In-913593440 |P0Thread1of1ForFork2_#t~ite24_Out-913593440|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-913593440, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-913593440, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-913593440, ~weak$$choice2~0=~weak$$choice2~0_In-913593440, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-913593440|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-913593440} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-913593440, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-913593440, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-913593440, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-913593440|, ~weak$$choice2~0=~weak$$choice2~0_In-913593440, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-913593440|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-913593440} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-26 23:46:55,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 23:46:55,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:46:55,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1992384493 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1992384493 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1992384493| ~x~0_In1992384493) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In1992384493 |ULTIMATE.start_main_#t~ite41_Out1992384493|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1992384493, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1992384493, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1992384493, ~x~0=~x~0_In1992384493} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1992384493|, ~x$w_buff1~0=~x$w_buff1~0_In1992384493, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1992384493, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1992384493, ~x~0=~x~0_In1992384493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:46:55,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-26 23:46:55,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In799716269 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In799716269 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out799716269|)) (and (= |ULTIMATE.start_main_#t~ite43_Out799716269| ~x$w_buff0_used~0_In799716269) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In799716269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In799716269} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In799716269, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out799716269|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In799716269} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:46:55,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-705813453 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-705813453 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-705813453 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-705813453 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-705813453|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-705813453 |ULTIMATE.start_main_#t~ite44_Out-705813453|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-705813453, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-705813453, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-705813453, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705813453} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-705813453, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-705813453, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-705813453, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-705813453|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705813453} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:46:55,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-541491988 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-541491988 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-541491988| ~x$r_buff0_thd0~0_In-541491988) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-541491988|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-541491988, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-541491988} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-541491988, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-541491988|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-541491988} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:46:55,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1264442438 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1264442438 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1264442438 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1264442438 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1264442438| ~x$r_buff1_thd0~0_In-1264442438) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out-1264442438| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1264442438, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1264442438, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1264442438, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1264442438} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1264442438, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1264442438|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1264442438, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1264442438, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1264442438} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 23:46:55,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} 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-26 23:46:55,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:46:55 BasicIcfg [2019-12-26 23:46:55,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:46:55,352 INFO L168 Benchmark]: Toolchain (without parser) took 188414.17 ms. Allocated memory was 145.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.3 MB in the beginning and 1.0 GB in the end (delta: -931.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 23:46:55,358 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:46:55,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 897.82 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 156.9 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:55,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.82 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:55,359 INFO L168 Benchmark]: Boogie Preprocessor took 45.07 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:55,359 INFO L168 Benchmark]: RCFGBuilder took 817.13 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 105.5 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:55,360 INFO L168 Benchmark]: TraceAbstraction took 186584.92 ms. Allocated memory was 203.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.5 MB in the beginning and 1.0 GB in the end (delta: -928.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 23:46:55,362 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 897.82 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 156.9 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.82 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.07 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.13 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 105.5 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186584.92 ms. Allocated memory was 203.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.5 MB in the beginning and 1.0 GB in the end (delta: -928.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2085, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L820] FCALL, FORK 0 pthread_create(&t2086, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2087, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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_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))=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=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 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 [L831] 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: 186.2s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 80.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6618 SDtfs, 12478 SDslu, 23122 SDs, 0 SdLazy, 24698 SolverSat, 823 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 47 SyntacticMatches, 39 SemanticMatches, 573 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5243 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 80.0s AutomataMinimizationTime, 38 MinimizatonAttempts, 226006 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1480 NumberOfCodeBlocks, 1480 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1386 ConstructedInterpolants, 0 QuantifiedInterpolants, 311964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...